Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.07642

Aut\`omats de Stallings, un cam\'i d'anada i tornada

Jordi Delgado·Enric Ventura
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we review some of the fundamental properties of the free group and give a detailed account of Stallings's theory of automata, a geometric interpretation of its subgroups that has been (and still is) immensely fruitful, both as a means of understanding classical results, as as a source of new results. We review some of the most important ones. -- - En aquest article revisem algunes de les propietats fonamentals del group lliure i fem una exposici\'o detallada de la teoria dels aut\`omats de Stallings, una interpretaci\'o geom\`etrica dels seus subgrups que ha estat (i segueix essent) immensament fruct\'ifera, tant com a mitj\`a per entendre resultats cl\`assics, com com a font de nous resultats. N'expliquem alguns dels m\'es rellevants.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Jordi Delgado, Enric Ventura. 2022-02-15. Aut\`omats de Stallings, un cam\'i d'anada i tornada. https://arxiv.org/abs/2202.07642

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗