Combinatorial aspects of code loops
Group Theory
2007-05-23 v1
Abstract
The existence and uniqueness (up to equivalence) of code loops was first established by R. Griess. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire. Within this paper, we focus on their combinatorial construction and prove a more general result using the language of derived forms.
Keywords
Cite
@article{arxiv.math/0701691,
title = {Combinatorial aspects of code loops},
author = {Petr Vojtěchovský},
journal= {arXiv preprint arXiv:math/0701691},
year = {2007}
}
Comments
6 pages