Metraipolis › archive › dc_c98ce8935153
A Simple Way of Getting Large Examples of Osborn Loops — arXiv:2609.09176
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.09176
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T11:18:11.489Z
- SHA-256 of the archived text
9a410482e011df49779b6837ff92f4279f38850f12a5deea35c808750ac13859- Stable URL of this page
https://metraipolis.com/documento/dc_c98ce8935153
How to cite
A Simple Way of Getting Large Examples of Osborn Loops — arXiv:2609.09176 — arXiv (en), https://arxiv.org/abs/2609.09176 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c98ce8935153 (Metraipolis archive dc_c98ce8935153, sha256 9a410482e011df49779b6837ff92f4279f38850f12a5deea35c808750ac13859)
BibTeX
@misc{dcc98ce8935153,
title = {A Simple Way of Getting Large Examples of Osborn Loops — arXiv:2609.09176},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.09176},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c98ce8935153; sha256 9a410482e011df49779b6837ff92f4279f38850f12a5deea35c808750ac13859},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09176. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Examples and counterexamples define the boundaries of mathematical propositions, test foundational conjectures, and resolve open structural problems in abstract algebra. In loop theory, an Osborn loop is a crucial generalization of a Moufang loop satisfying a specialized variable-sandwiching identity. While small finite non-associative examples are known, constructing large examples of proper Osborn loops (loops that are neither conjugacy closed nor Moufang) remains a computational bottleneck. In this paper, we establish an efficient framework for generating large proper Osborn loops by taking the direct product of non-associative conjugacy closed (CC) loops and Moufang loops. We outline the boundary constraints necessary to prevent structural collapse into sub-varieties and provide explicit examples up to order 2025 validated via the GAP package \texttt{LOOPS}.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in cs.LO).
Categorie arXiv: Rings and Algebras (math.RA) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.09176 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T10:56:27.511Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).