Degree-and-type conjecture for representations of code loops
Degree-and-type conjecture for representations of code loops
Let be a code loop, and let and be representations of . The degree and type of a representation are the corresponding representation invariants.
Degree-and-type conjecture. If and have the same degree and type, then they are isomorphic.
The claim is motivated by the fact that, for code loops of ranks and , the type determines the code loop up to isomorphism. The supplied text gives no resolution beyond suggesting that the rank- and rank- observation may hold in general.
Sources & referencesView supporting material
Primary source
Alexandre Grichkov and Rosemary M. Pires, “Code loops: automorphisms and representations”, arXiv:1412.2185 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.