English
Related papers

Related papers: Finite-index accessibility of groups

200 papers

The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…

Group Theory · Mathematics 2023-06-02 D. Osin

It is proved that if a finite group $G$ has an automorphism of order $n$ with $m$ fixed points, then $G$ has a soluble subgroup whose index and Fitting height are bounded in terms of $m$ and $n$. As a corollary, a problem of B. Hartley is…

Group Theory · Mathematics 2025-08-21 Evgeny Khukhro

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Group Theory · Mathematics 2007-05-23 Matt Clay

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

Optimization and Control · Mathematics 2019-08-09 Mohammad Amin Sarafrazi , Ülle Kotta , Zbigniew Bartosiewicz

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…

Group Theory · Mathematics 2024-02-23 Pierre-Emmanuel Caprace , Timothée Marquis , Colin D. Reid

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

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Combinatorics · Mathematics 2016-01-22 Lucas Hosseini , Patrice Ossona de Mendez

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…

Group Theory · Mathematics 2025-10-28 R. Bastos , G. Ortega

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…

Group Theory · Mathematics 2020-07-23 Nicolas Radu

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

We prove that a saturated weakly branch group $G$ has the property $R_\infty$ (any automorphism $\phi:G\to G$ has infinite Reidemeister number) in each of the following cases: 1) any element of $Out(G)$ has finite order; 2) for any $\phi$…

Group Theory · Mathematics 2019-05-01 Evgenij Troitsky

We study actions of finitely generated groups on $\bbR$-trees under some stability hypotheses. We prove that either the group splits over some controlled subgroup (fixing an arc in particular), or the action can be obtained by gluing…

Group Theory · Mathematics 2007-05-23 Vincent Guirardel

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…

Group Theory · Mathematics 2018-11-07 Gareth Wilkes

We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a…

Combinatorics · Mathematics 2026-03-02 Romain Bourneuf , Gwenaël Joret , Piotr Micek , Martin Milanič , Michał Pilipczuk

We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…

Combinatorics · Mathematics 2023-05-17 Marcel Koloschin , Thilo Krill , Max Pitz

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…

Group Theory · Mathematics 2012-06-29 Jakub Gismatullin

The deformation space of a simplicial G-tree T is the set of G-trees which can be obtained from T by some collapse and expansion moves, or equivalently, which have the same elliptic subgroups as T. We give a short proof of a rigidity result…

Group Theory · Mathematics 2014-11-11 Vincent Guirardel

Let $G$ be a group acting $2$-transitively on the boundary of a locally finite tree, and exclude the situation (which is a genuine exception) where $G$ has both $\mathrm{P}\Gamma\mathrm{L}_3(4)$ and $\mathrm{P}\Gamma\mathrm{L}_3(5)$ as…

Group Theory · Mathematics 2024-08-12 Colin D. Reid

The celebrated Stallings' decomposition theorem states that the splitting of a finite index subgroup $H$ of a finitely generated group $G$ as an amalgamated free product or an HNN-extension over a finite group implies the same for $G$. We…

Group Theory · Mathematics 2021-10-12 Mattheus Aguiar , Pavel Zalesski

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…

Combinatorics · Mathematics 2021-09-06 Guillaume Chapuy , Guillem Perarnau