Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/129988
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNagy, B.-
dc.contributor.authorRoberts, D.M.-
dc.date.issued2021-
dc.identifier.citationAmerican Mathematical Monthly, 2021; 128(2):151-161-
dc.identifier.issn0002-9890-
dc.identifier.issn1930-0972-
dc.identifier.urihttp://hdl.handle.net/2440/129988-
dc.descriptionPublished online: 09 Feb 2021-
dc.description.abstractThe Moufang loop named for Richard Parker is a central extension of the extended binary Golay code. It the prototypical example of a general class of nonassociative structures known today as code loops, which have been studied from a number of different algebraic and combinatorial perspectives. This expository article aims to highlight an experimental approach to computing in code loops, by a combination of a small amount of precomputed information and making use of the rich identities that code loops' twisted cocycles satisfy. As a byproduct we demonstrate that one can reconstruct the multiplication in Parker's loop from a mere fragment of its twisted cocycle. We also give relatively large subspaces of the Golay code over which Parker's loop splits as a direct product.-
dc.description.statementofresponsibilityBen Nagy and David Michael Roberts-
dc.language.isoen-
dc.publisherTaylor & Francis-
dc.rights© The Mathematical Association of America-
dc.source.urihttp://dx.doi.org/10.1080/00029890.2021.1852047-
dc.title(Re)constructing code loops-
dc.typeJournal article-
dc.identifier.doi10.1080/00029890.2021.1852047-
dc.relation.granthttp://purl.org/au-research/grants/arc/DP180100383-
pubs.publication-statusPublished-
dc.identifier.orcidNagy, B. [0000-0002-5214-7595]-
dc.identifier.orcidRoberts, D.M. [0000-0002-3478-0522]-
Appears in Collections:Aurora harvest 8
Mathematical Sciences publications

Files in This Item:
File Description SizeFormat 
hdl_129988.pdfSubmitted version875.74 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.