Related papers: Context-Free Groups and Their Structure Trees

The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is…

Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…

This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a…

We construct the first example of a finitely generated group which has Serre's property (FA) (i.e., whenever it acts on a simplicial tree it fixes a vertex), but admits a fixed point-free action on an $\mathbb{R}$-tree with finite arc…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has infinitely many trees almost surely.…

Let $G\curvearrowright T$ be a minimal action on an $\mathbb{R}$--tree with $G$ finitely presented. Assuming that $G$ is accessible over the family of arc-stabilisers of $T$, we give a description of the point-stabilisers of $T$ in terms of…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…

We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists…

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

We investigate fixed subgroups of automorphisms of generalised Baumslag-Solitar (GBS) groups. Our main results are for automorphisms leaving a Bass-Serre tree invariant, under the assumption that all edge stabilisers are strictly contained…

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to…

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Building on a construction of J-P. Serre, we associate to any graph of C*-algebras a maximal and a reduced fundamental C*-algebra and use this theory to construct the fundamental quantum group of a graph of discrete quantum groups. This…