SearcharxivSearch

arXiv · 1209.5248

On vertex stabilisers in symmetric quintic graphs

Abstract

In this paper we determine all locally finite and symmetric actions of a group on the tree of valency five. As a corollary we complete the classification of the isomorphism types of vertex and edge stabilisers in a group acting symmetrically on a graph of valency five. This builds on work of Weiss and recent work of Zhou and Feng. This depends upon the second result of this paper, the classification of isomorphism types of finite, primitive amalgams of degree (5, 2).

Explore related subjects

Keep this discovery

BibTeXRIS

G. L. Morgan. 2012-09-24. On vertex stabilisers in symmetric quintic graphs. https://arxiv.org/abs/1209.5248

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