Related papers: An improved proof of the Almost Stability Theorem

It is shown that a Stallings--Swan theorem holds in a totally disconnected locally compact (= t.d.l.c.) context (cf. Thm. B). More precisely, a compactly generated $\mathcal{CO}$-bounded t.d.l.c. group $G$ of rational discrete cohomological…

A short proof of a conjecture of Kropholler is given. This gives a relative version of Stallings' Theorem on the structure of groups with more than one end. A generalisation of the Almost Stability Theorem is also obtained, that gives…

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

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…

In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually…

Consider $\operatorname{Sym}(n)$, endowed with the normalized Hamming metric $d_n$. A finitely-generated group $\Gamma$ is \emph{P-stable} if every almost homomorphism $\rho_{n_k}\colon \Gamma\rightarrow\operatorname{Sym}(n_k)$ (i.e., for…

Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…

A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…

We prove that any product of two non-abelian free groups, $\Gamma=\mathbb F_m\times\mathbb F_k$, for $m,k\geq 2$, is not Hilbert-Schmidt stable. This means that there exist asymptotic representations $\pi_n:\Gamma\rightarrow…

We examine Hilbert-Schmidt stability (HS-stability) of discrete amenable groups from several angles. We give a short, elementary proof that finitely generated nilpotent groups are HS-stable. We investigate the permanence of HS-stability…

We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…

``What aspects of a group are unchanged, or stable, under homology equivalences''? The model theorem in this regard is the 1963 result of J. Stallings that the lower central series is preserved under any integral homological equivalence of…

Almost finiteness was introduced in the seminal work of Kerr as an dynamical analogue of Z-stability in the Toms-Winter conjecture. In this article, we provide the first examples of minimal, topologically free actions of amenable groups…

We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…

Working within the framework of free actions of countable amenable groups on compact metrizable spaces, we show that the small boundary property is equivalent to a density version of almost finiteness, which we call almost finiteness in…

The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…