SearcharxivSearch

arXiv · 2510.19961

Loops with squares in two nuclei

Abstract

Although little can be gleaned about a loop with the property that its squares are, say, left nuclear ($xx\cdot yz = (xx\cdot y)z$), if its squares are also, say, middle nuclear ($(x\cdot yy)z = x(yy\cdot z)$), then the loop exhibits more structure than one might initially guess. Loops with squares in (at least) two nuclei include many well known classes of loops, such as C loops and extra loops, and not so well known classes such left C loops. In any loop with, say, left and middle nuclear squares, the intersection of the left and middle nuclei is a normal subloop; hence such a loop is simple if and only if it is a group or a simple unipotent loop. Loops in which squaring is a centralizing endomorphism have even more structure; they are power-associative, and a torsion loop in that class is a direct product of a loop of $2$-elements and a loop of elements of odd order.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Kinyon, J. D. Phillips. 2025-10-22. Loops with squares in two nuclei. https://arxiv.org/abs/2510.19961

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR