Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.08385

Cayley graph diameters for fixed cycle types are eventually quasipolynomial

Andrei Smolensky
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a cycle type, the corresponding conjugacy class of $S_n$ generates either $S_n$ or $A_n$ for sufficiently large $n$. We prove that the sequence of diameters of Cayley graphs is eventually polynomial on residue classes for any fixed cycle type. This result is also extended to finite unions of conjugacy classes.

Explore related subjects

math.GRmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei Smolensky. 2026-10-06. Cayley graph diameters for fixed cycle types are eventually quasipolynomial. https://arxiv.org/abs/2610.08385

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On strongly reversible elements in the Riordan group

An element of a group is called \emph{reversible} if it is conjugate to its inverse, and \emph{strongly reversible} if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and its various important subgroups. We prove that not every reversible element in the Riordan group is strongly reversible, and we investigate products of reversible elements in the Riordan group.

math.GR↗
arXiv2026

Finite groups whose proper subgroups of order divisible by $p$ are supersolvable

Let $p$ be an odd prime, and let $G$ be a finite group whose order is divisible by $p$. Suppose that every proper subgroup of $G$ whose order is divisible by $p$ is supersolvable, while $G$ itself is not. In this paper, we investigate the arithmetic and structural properties of such groups, addressing both the solvable and nonsolvable cases.

math.GR↗
arXiv2026

Small growth rates of free groups

We introduce the notion of a Magnus marking for a finite generating set of a group and prove a certain expansion property. Using this property, we determine the second and third smallest growth rates of the rank-$d$ free group for $d\ge 2$. We also give a new lower bound for the smallest growth rate of the genus-$g$ surface group for $g\ge 2$, as well as a lower bound for the growth rate associated with a one-relator presentation.

math.GR↗