SearcharxivSearch

arXiv · 1103.0054

Loops with exponent three in all isotopes

Abstract

It was shown by van Rees \cite{vR} that a latin square of order $n$ has at most $n^2(n-1)/18$ latin subsquares of order $3$. He conjectured that this bound is only achieved if $n$ is a power of $3$. We show that it can only be achieved if $n\equiv3\bmod6$. We also state several conditions that are equivalent to achieving the van Rees bound. One of these is that the Cayley table of a loop achieves the van Rees bound if and only if every loop isotope has exponent $3$. We call such loops \emph{van Rees loops} and show that they form an equationally defined variety. We also show that (1) In a van Rees loop, any subloop of index 3 is normal, (2) There are exactly 6 nonassociative van Rees loops of order $27$ with a non-trivial nucleus and at least 1 with all nuclei trivial, (3) Every commutative van Rees loop has the weak inverse property and (4) For each van Rees loop there is an associated family of Steiner quasigroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Kinyon, Ian M. Wanless. 2011-02-28. Loops with exponent three in all isotopes. https://arxiv.org/abs/1103.0054

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