Minimal defining identities conjecture for the variety of code loops
Minimal defining identities conjecture for the variety of code loops
Let be the variety of Moufang loops generated by all code loops, defined by the identities
Minimal identities conjecture. These identities form a minimal set of identities defining the variety .
The identities originally used to define are noted to be nonindependent; the conjecture asks whether the four displayed identities are sufficient and minimal.
Sources & referencesView supporting material
Primary source
Alexandre Grichkov and Rosemary M. Pires, “Code loops: automorphisms and representations”, arXiv:1412.2185 (2014).
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.