SearcharxivSearch

arXiv · 2012.01773

Finite totally $k$-closed groups

Abstract

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits in the induced action on $\Omega\times\dots\times \Omega=\Omega^k$. We prove that every abelian group $G$ is totally $(n(G)+1)$-closed, but is not totally $n(G)$-closed, where $n(G)$ is the number of invariant factors in the invariant factor decomposition of $G$. In particular, we prove that for each $k\geq2$ and each prime $p$, there are infinitely many finite abelian $p$-groups which are totally $k$-closed but not totally $(k-1)$-closed. This result in the special case $k=2$ is due to Abdollahi and Arezoomand. We pose several open questions about total $k$-closure.

Explore related subjects

Keep this discovery

BibTeXRIS

Dmitry Churikov, Cheryl E. Praeger. 2020-12-03. Finite totally $k$-closed groups. https://arxiv.org/abs/2012.01773

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