English

Biggs tree groups

Group Theory 2025-11-25 v2

Abstract

Biggs gave an explicit construction, using finite colored trees, of finite permutation groups whose Cayley graphs have valence CC and girth tending to infinity as the radius RR of the tree tends to infinity. We show that when the number of colors is at least 3, the group so presented contains the full alternating group on the vertices of the tree. This gives, for each C3C\geq 3, an infinite family of pairs (GC,R,SC,R)(G_{C,R},S_{C,R}) such that GC,RG_{C,R} is an alternating or symmetric group, SC,RS_{C,R} is a generating set of GC,RG_{C,R} of size CC with an explicit permutation description of its generators, and such that the sequence of Cayley graphs Cay(GC,R,SC,R)\mathrm{Cay}(G_{C,R},S_{C,R}) has constant valence CC and girth tending to infinity as RR tends to infinity.

Keywords

Cite

@article{arxiv.2511.13292,
  title  = {Biggs tree groups},
  author = {Christopher H. Cashen},
  journal= {arXiv preprint arXiv:2511.13292},
  year   = {2025}
}

Comments

14 pages, 7 figures, 1 table; v2 upgrades main theorem from 'for infinitely many R' to 'for all R'

R2 v1 2026-07-01T07:41:01.127Z