Toward the classification of Moufang loops of order 64

Simple item page
dc.creatorVojtěchovský, Petr
dc.date2007-01-24
dc.date.accessioned2026-07-07T07:42:53Z
dc.date.available2026-07-07T07:42:53Z
dc.descriptionWe show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no other nonassociative Moufang loops of order 64. The main idea of the computer search is to modify precisely one quarter of the multiplication table in a certain way, previously applied to small 2-groups.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0701712
dc.identifierhttp://arxiv.org/abs/math/0701712
dc.identifierEuropean Journal of Combinatorics 27, issue 3 (April 2006), 444-460
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122612
dc.subjectGroup Theory
dc.subject20N05
dc.titleToward the classification of Moufang loops of order 64
dc.typetext

Files

Collections

arXiv