Uniqueness of code-loop representations by degree and type
Uniqueness of code-loop representations by degree and type
Let be a code loop, and let and be representations of . The degree-and-type uniqueness 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 3 and 4, the type determines the loop up to isomorphism; whether the analogous uniqueness holds in general is left open.
Sources & referencesView supporting material
Primary source
Rosemary Miguel Pires, Alexandre Grishkov and Marina Rasskazova, “Representations of code loops by binary codes”, arXiv:1909.05143 (2019).
Progress summary
Never refreshed
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.