English
Related papers

Related papers: Context-Free Groups and Their Structure Trees

200 papers

We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…

Group Theory · Mathematics 2015-01-05 M. J. Dunwoody , B. Krön

We introduce a class of spaces, called real cubings, and study the stucture of groups acting nicely on these spaces. Just as cubings are a natural generalisation of simplicial trees, real cubings can be regarded as a natural generalisation…

Group Theory · Mathematics 2011-10-04 Montserrat Casals-Ruiz , Ilya Kazachkov

Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…

Group Theory · Mathematics 2007-05-23 Miklos Abert , Yair Glasner

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…

Group Theory · Mathematics 2024-08-21 Rylee Alanza Lyman

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

Group Theory · Mathematics 2012-09-18 Rögnvaldur G. Möller , Jan Vonk

We construct a finitely presented torsion-free simple group $\Sigma_0$, acting cocompactly on a product of two regular trees. An infinite family of such groups has been introduced by Burger-Mozes ([2,4]). We refine their methods and get…

Group Theory · Mathematics 2007-05-23 Diego Rattaggi

The primary tool for analysing groups acting on trees is Bass--Serre Theory. It is comprised of two parts: a decomposition result, in which an action is decomposed via a graph of groups, and a construction result, in which graphs of groups…

Group Theory · Mathematics 2023-09-12 Colin D. Reid , Simon M. Smith

We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For…

Group Theory · Mathematics 2007-05-23 Lee Mosher , Michah Sageev , Kevin Whyte

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Group Theory · Mathematics 2024-12-17 Murray Elder , Giles Gardam , Adam Piggott , Davide Spriano , Kane Townsend

An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, \chi)$ where $T$ is a tree and $\chi : V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms:…

Combinatorics · Mathematics 2026-05-07 Maria Chudnovsky , Ajaykrishnan E S , Daniel Lokshtanov

We have defined and established a theory of cofinite connectedness of a cofinite graph. Many of the properties of connectedness of topological spaces have analogs for cofinite connectedness. We have seen that if $G$ is a cofinite group and…

General Topology · Mathematics 2016-02-05 Amrita Acharyya , Jon M. Corson , Bikash Das

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

Combinatorics · Mathematics 2012-11-27 Francesco G. Russo

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…

Combinatorics · Mathematics 2024-09-13 Louis Esperet , Ugo Giocanti , Clément Legrand-Duchesne

We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…

Group Theory · Mathematics 2025-01-01 Antoine Goldsborough , Stefanie Zbinden

In this paper, we study Bass-Serre theory from the perspectives of $C^*$-algebras and topological dynamics. In particular, we investigate the actions of fundamental groups of graphs of groups on their Bass-Serre trees and the associated…

Operator Algebras · Mathematics 2026-04-10 Xin Ma , Daxun Wang , Wenyuan Yang

For a formation $\mathfrak{F}$ of finite groups, tight connections are established between the pro-$\mathfrak{F}$-topology of a finitely generated free group $F$ and the geometry of the Cayley graph $\Gamma(\hat{F_{\mathfrak{F}}})$ of the…

Group Theory · Mathematics 2016-01-22 K. Auinger

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Group Theory · Mathematics 2024-04-17 Max Forester , Anthony Martino

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

If $G$ is a free product of finite groups, let $\Sigma Aut_1(G)$ denote all (necessarily symmetric) automorphisms of $G$ that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em…

Geometric Topology · Mathematics 2007-05-23 Yuqing Chen , Henry Glover , Craig Jensen

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

Group Theory · Mathematics 2025-11-17 K. Auinger , J. Bitterlich , M. Otto