Related papers: Fat minors in finitely presented groups

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

We prove that infinitely presented classical $C(6)$ small cancellation groups are SQ-universal. We extend the result to graphical $Gr_*(6)$-groups over free products. For every $p\in\mathbb{N}$, we construct uncountably many pairwise…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

Fat minors are a coarse analogue of graph minors where the subgraphs modeling vertices and edges of the embedded graph are required to be distant from each other, instead of just being disjoint. In this paper, we give a coarse analogue of…

We show that the classical Baum-Connes assembly map is quantitatively an isomorphism for a class of lacunary hyperbolic groups, and we explain how to see that this class contains many examples of groups that contain graph sequences of large…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

We show (using results of Wise and of Woodhouse) that a tubular group is always virtually special (meaning that it has a finite index subgroup embedding in a RAAG) if the underlying graph is a tree. We also adapt Gardam and Woodhouse's…

We prove that every acylindrically hyperbolic group admits a minimal and extremely proximal action on a compact metrizable space. If there are no nontrivial finite normal subgroups, then the action is topologically free. This answers…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where…

A \emph{finite cover} of a group $G$ is a finite collection $\mathcal{C}$ of proper subgroups of $G$ with the property that $\bigcup \mathcal{C} = G$. A finite group admits a finite cover if and only if it is noncyclic. More generally, it…

We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

In this note we show that the family of Cayley graphs of a finitely generated subgroup of ${\rm GL}_{n_0}(\mathbb{F}_p(t))$ modulo some admissible square-free polynomials is a family of expanders under certain algebraic conditions. Here is…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

We present an algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We use this to prove that a mapping torus of a finitely generated free group automorphism is…

We introduce and systematically study linear sofic groups and linear sofic algebras. This generalizes amenable and LEF groups and algebras. We prove that a group is linear sofic if and only if its group algebra is linear sofic. We show that…