Minimal defining identities conjecture for the variety of code loops

Let E{\cal E} be the variety of Moufang loops generated by all code loops, defined by the identities

x4=1,[x,y]2=1,(x2,y)=1,(x2,y,z)=1.x^4=1,\qquad [x,y]^2=1,\qquad (x^2,y)=1,\qquad (x^2,y,z)=1.

Minimal identities conjecture. These identities form a minimal set of identities defining the variety E{\cal E}.

The identities originally used to define E{\cal E} 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

No solutions have been posted yet.