Uniqueness of code-loop representations by degree and type
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.