SearcharxivSearch

arXiv · 2109.13882

Finite transitive groups having many suborbits of cardinality at most two and an application to the enumeration of Cayley graphs

Abstract

Let $G$ be a finite transitive group on a set $\Omega$, let $\alpha\in \Omega$ and let $G_\alpha$ be the stabilizer of the point $\alpha$ in $G$. In this paper, we are interested in the proportion $$\frac{|\{\omega\in \Omega\mid \omega \textrm{ lies in a }G_\alpha\textrm{-orbit of cardinality at most two}\}|}{|\Omega|},$$ that is, the proportion of elements of $\Omega$ lying in a suborbit of cardinality at most two. We show that, if this proportion is greater than $5/6$, then each element of $\Omega$ lies in a suborbit of cardinality at most two and hence $G$ is classified by a result of Bergman and Lenstra. We also classify the permutation groups attaining the bound $5/6$. We use these results to answer a question concerning the enumeration of Cayley graphs. Given a transitive group $G$ containing a regular subgroup $R$, we determine an upper bound on the number of Cayley graphs on $R$ containing $G$ in their automorphism groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Pablo Spiga. 2021-09-28. Finite transitive groups having many suborbits of cardinality at most two and an application to the enumeration of Cayley graphs. https://arxiv.org/abs/2109.13882

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