SearcharxivSearch

arXiv · 1802.10471

Approximate Subloops in Moufang Loops

Abstract

We introduce a notion of finite approximate subloops in Moufang loops, with emphasis on the commutative case. For arbitrary Moufang loops we establish intrinsic product-set identities and covering consequences without passing through associative quotients and obtain a finite-kernel reduction principle: approximate-subloop structure descends through homomorphisms onto groups with finite kernel, and inverse results in the quotient lift back to the loop. In particular, this yields a complete reduction in the two-generated case. For commutative Moufang loops, using their local finite-by-abelian structure, we deduce a Freiman-type theorem showing that a finite approximate subloop is contained in the pullback of a coset progression from a suitable local abelian quotient, with quantitative bounds depending only on the corresponding finite kernel. We then obtain a uniform version for approximate subloops generating an $m$-generated subloop. When the local abelian quotient has bounded torsion, we get a polynomial covering theorem by cosets of a finite subloop, deduced from the bounded-torsion polynomial Freiman--Ruzsa theorem in the abelian quotient; in particular, this applies to commutative Moufang loops of exponent $3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Arindam Biswas. 2018-02-28. Approximate Subloops in Moufang Loops. https://arxiv.org/abs/1802.10471

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