Related papers: Growth of groups with linear Schreier graphs
Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a…
In 1980 Rostislav Grigorchuk constructed a group $G$ of intermediate growth, and later obtained the following estimates on its growth $\gamma$: $e^{\sqrt{n}}\precsim\gamma(n)\precsim e^{n^\beta},$ where $\beta=\log_{32}(31)\approx0.991$. He…
We give upper bounds on the order of the automorphism group of a simple graph
The scaling entropy of a p.m.p. action is a slow-entropy type invariant that characterizes the intermediate growth of entropy in a dynamical system. An amenable group $G$ has a scaling entropy growth gap if the scaling entropy of any its…
We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…
A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…
We prove that non-elementary hyperbolic groups grow exponentially more quickly than their infinite index quasiconvex subgroups. The proof uses the classical tools of automatic structures and Perron-Frobenius theory. We also extend the main…
Mathematical methods of analysis of data and of predicting growth are discussed. The starting point is the analysis of the growth rates, which can be expressed as a function of time or as a function of the size of the growing entity.…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
We introduce what we call `generalized higher rank $k$-graphs' as a class of categories equipped with a notion of size. They extend not only the higher rank $k$-graphs, but also the Levi categories introduced by the first author as a…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We prove that the growth rate of an endomorphism of a finitely generated nilpotent group equals to the growth rate of induced endomorphism on its abelinization, generalizing the corresponding result for an automorphism in [14]. We also…
This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…
This paper proves that in a non-elementary relatively hyperbolic group, the logarithm growth rate of any non-elementary subgroup has a linear lower bound by the logarithm of the size of the corresponding generating set. As a consequence,…
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…
We define the notion of rough Cayley graph for compactly generated locally compact groups in terms of quasi-actions. We construct such a graph for any compactly generated locally compact group using quasi-lattices and show uniqueness up to…
We generalize a class of groups defined by Rostislav Grigorchuk to a much larger class of groups, and provide upper and lower bounds for their word growth (they are all of intermediate growth) and period growth (under a small additional…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
This paper concentrates on positive definite functions on finite abelian groups, which are central to harmonic analysis and related fields. By leveraging the group structure and employing Fourier analysis, we establish a lower bound for the…
We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_{\Gamma} : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_{\Gamma}$ is bounded iff…