Degree-and-type conjecture for representations of code loops
Statement
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.
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.