Related papers: Growth of groups with linear Schreier graphs
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…
For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…
We study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. The maximality of the growth implies some other specific properties of these acts…
S. Bera (Line graph characterization of power graphs of finite nilpotent groups, \textit{Communication in Algebra}, 50(11), 4652-4668, 2022) characterized finite nilpotent groups whose power graphs and proper power graphs are line graphs.…
Fixing a subgroup $\Gamma$ in a group $G$, the full commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] \leq n$. For…
Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…
The number of common friends (or connections) in a graph is a commonly used measure of proximity between two nodes. Such measures are used in link prediction algorithms and recommendation systems in large online social networks. We obtain…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…
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),…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We discuss some numerical invariants of multidimensional shifts of finite type (SFTs) which are associated with the growth rates of the number of admissible finite configurations. Extending an unpublished example of Tsirelson, we show that…
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…