Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 28 Sep 2021 in math.GR and math.CO | (2109.13882v1)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.