SearcharxivSearch

arXiv · 2102.11900

Fixity of elusive groups and the polycirculant conjecture

Abstract

Let $G\leq{\rm Sym}(\Omega)$ be transitive. Then $G$ is called \textit{elusive} on $\Omega$ if it has no fixed point free element of prime order. The \textit{$2$-closure} of $G$, denoted by $G^{(2),\Omega}$, is the largest subgroup of ${\rm Sym}(\Omega)$ whose orbits on $\Omega\times\Omega$ are the same orbits of $G$. $G$ is called $2$-closed on $\Omega$ if $G=G^{(2),\Omega}$. The \textit{polycirculant conjecture} states that there is no $2$-closed elusive group. In this paper, we study the \textit{fixity} of elusive groups, where the fixity of $G$ is the maximal number of fixed points of a non-trivial element of $G$. In particular, we prove that there is no $2$-closed elusive solvable group of fixity at most $5$, a partial answer to the polycirculant conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Majid Arezoomand. 2021-02-23. Fixity of elusive groups and the polycirculant conjecture. https://arxiv.org/abs/2102.11900

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