Mathematics > Group Theory
[Submitted on 16 Sep 2015 (v1), last revised 30 Nov 2016 (this version, v3)]
Title:A classification theorem for boundary 2-transitive automorphism groups of trees
View PDFAbstract:Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each vertex contains the alternating group. The outcome of the classification for a fixed tree $T$ is a countable family of groups, all containing two remarkable subgroups: a simple subgroup of index $\leq 8$ and (the semiregular analog of) the universal locally alternating group of Burger-Mozes (with possibly infinite index). We also provide an explicit example showing that the statement of this classification fails for trees of smaller degree.
Submission history
From: Nicolas Radu [view email][v1] Wed, 16 Sep 2015 13:34:53 UTC (46 KB)
[v2] Mon, 10 Oct 2016 10:02:05 UTC (53 KB)
[v3] Wed, 30 Nov 2016 21:32:28 UTC (53 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.