Related papers: Isoperimetry in Finitely Generated Groups
We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
Surprisingly, apart from some special cases, simple asymptotic expansions for the associated Legendre functions $P_\nu ^\mu (z)$ and $Q_\nu ^\mu (z)$ for large degree $\nu$ or large order $\mu$ are not available in the literature. The main…
If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…
We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
We give a subexponential upper bound and a superpolynomial lower bound on the growth function of the Fabrykowski-Gupta group. As a consequence, we answer negatively a question by Longobardi, Maj and Rhemtulla about characterizing groups…
This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…
We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quantify the effectiveness and complexity of invariants for…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
In this short article, we study the extremal behavior $F_\Gamma(n)$ of divisibility functions $D_\Gamma$ introduced by the first author for finitely generated groups $\Gamma$. We show finitely generated subgroups of $\GL(m,K)$ for an…
The vertex isoperimetric number of a graph $G=(V,E)$ is the minimum of the ratio $|\partial_{V}U|/|U|$ where $U$ ranges over all nonempty subsets of $V$ with $|U|/|V|\le u$ and $\partial_{V}U$ is the set of all vertices adjacent to $U$ but…
Given a finitely generated amenable group $H$ satisfying some mild assumptions, we relate isoperimetric profiles of the lampshuffler group $\mathsf{Shuffler}(H)=\mathsf{FSym}(H)\rtimes H$ to those of $H$. Our results are sharp for all…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower…
We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…