SearcharxivSearch

arXiv · 1712.06524

Code loops in dimension at most 8

Abstract

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of order $2$ by an elementary abelian $2$-group $V$ in the variety of loops such that their squaring map, commutator map and associator map are related by combinatorial polarization and the associator map is a trilinear alternating form. Using existing classifications of trilinear alternating forms over the field of $2$ elements, we enumerate code loops of dimension $d=\mathrm{dim}(V)\le 8$ (equivalently, of order $2^{d+1}\le 512$) up to isomorphism. There are $767$ code loops of order $128$, and $80826$ of order $256$, and $937791557$ of order $512$.

Explore related subjects

Keep this discovery

BibTeXRIS

E. A. O'Brien, Petr Vojtěchovský. 2017-12-18. Code loops in dimension at most 8. https://arxiv.org/abs/1712.06524

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR