SearcharxivSearch

arXiv · 1712.06521

Automorphic loops arising from module endomorphisms

Abstract

A loop is automorphic if all its inner mappings are automorphisms. We construct a large family of automorphic loops as follows. Let $R$ be a commutative ring, $V$ an $R$-module, $E=\mathrm{End}_R(V)$ the ring of $R$-endomorphisms of $V$, and $W$ a subgroup of $(E,+)$ such that $ab=ba$ for every $a$, $b\in W$ and $1+a$ is invertible for every $a\in W$. Then $Q_{R,V}(W)$ defined on $W\times V$ by $(a,u)(b,v) = (a+b,u(1+b)+v(1-a))$ is an automorphic loop. A special case occurs when $R=k<K=V$ is a field extension and $W$ is a $k$-subspace of $K$ such that $k1\cap W = 0$, naturally embedded into $\mathrm{End}_k(K)$ by $a\mapsto M_a$, $bM_a = ba$. In this case we denote the automorphic loop $Q_{R,V}(W)$ by $Q_{k<K}(W)$. We call the parameters tame if $k$ is a prime field, $W$ generates $K$ as a field over $k$, and $K$ is perfect when $\mathrm{char}(k)=2$. We describe the automorphism groups of tame automorphic loops $Q_{k<K}(W)$, and we solve the isomorphism problem for tame automorphic loops $Q_{k<K}(W)$. A special case solves a problem about automorphic loops of order $p^3$ posed by Jedlička, Kinyon and Vojtěchovský. We conclude the paper with a construction of an infinite $2$-generated abelian-by-cyclic automorphic loop of prime exponent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandr Grishkov, Marina Rasskazova, Petr Vojtěchovský. 2017-12-18. Automorphic loops arising from module endomorphisms. https://arxiv.org/abs/1712.06521

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