Combinatorial aspects of code loops
| dc.creator | Vojtěchovský, Petr | |
| dc.date | 2007-01-24 | |
| dc.date.accessioned | 2026-07-07T07:42:50Z | |
| dc.date.available | 2026-07-07T07:42:50Z | |
| dc.description | 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. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/math/0701691 | |
| dc.identifier | http://arxiv.org/abs/math/0701691 | |
| dc.identifier | proceedings of Loops '99, published in Comment. Math. Univ. Carolin. 41 (April 2000), no. 2, 429-435 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/122596 | |
| dc.subject | Group Theory | |
| dc.subject | 20N05 | |
| dc.title | Combinatorial aspects of code loops | |
| dc.type | text |