Answers are grounded in this paper and cite their sources.
Biggs presents a method for constructing permutation groups with specified properties in colored trees, suggesting new avenues in group theory.
Biggs gave an explicit construction, using finite colored trees, of finite permutation groups whose Cayley graphs have valence C and girth tending to infinity as the radius R 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 C ≥ 3, an infinite family of pairs (GC, R, SC, R) such thatGC, R is an alternating or symmetric group, SC, R is a generating set of GC, R of size C with an explicit permutation description of its generators, and such that the sequence of Cayley graphs Cay(GC, R, SC, R) has constant valence C and girth tending to infinity as R tends to infinity.
No takes yet. Share an insight, caveat, or question.
Christopher H. Cashen (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: