Related papers: Finite-index accessibility of groups

We study closed subgroups $G$ of the automorphism group of a locally finite tree $T$ acting doubly transitively on the boundary. We show that if the stabiliser of some end is metabelian, then there is a local field $k$ such that…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Let $p\ge 3$ be a prime. A generalised multi-edge spinal group is a subgroup of the automorphism group of a regular $p$-adic rooted tree T that is generated by one rooted automorphism and $p$ families of directed automorphisms, each family…

We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma,…

It is well known that if G is a finite group then the group of endotrivial modules is finitely generated. In this paper we prove that for an arbitrary finite group scheme G, and for any fixed integer n > 0, there are only finitely many…

Suppose that a locally finite group $G$ has a $2$-element $g$ with Chernikov centralizer. It is proved that if the involution in $\langle g\rangle$ has nilpotent centralizer, then $G$ has a soluble subgroup of finite index.

It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in…

A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $\Delta$ has a tree-partition with parts of size…

Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

We prove that the group property of being $\mathcal{H}-$ and $\mathcal{AH}-$accessible is preserved under finite extensions.

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…

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…