Related papers: Growth in product replacement graphs
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
We generalize the zig-zag product construction to produce infinite families of regular graphs of any constant degree. We analyze the second largest eigenvalue of this new zig-zag product to show that the modified zig-zag product of good…
This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…
We prove non-amenability of the product replacement graphs \Gamma_n(G) for uniformly non-amenable groups. We also prove it for Z-large groups, when n is sufficiently large. It follows that \Gamma_n(G) is non-amenable when n is sufficiently…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
I describe a class of groups acting on rooted trees. The original claim was that all have intermediate word growth between polynomial and exponential. The argument constructs a functional equation on the growth formal power series, and…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees…
It is shown that FC-central extensions retain sub-exponential volume growth. A large collection of FC-central extensions of the first Grigorchuk group is provided by the constructions in the works of Erschler and Kassabov-Pak. We show that…
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…
It is challenging for generative models to learn a distribution over graphs because of the lack of permutation invariance: nodes may be ordered arbitrarily across graphs, and standard graph alignment is combinatorial and notoriously…
Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…
The deep theory of approximate subgroups establishes 3-step product growth for subsets of finite simple groups $G$ of Lie type of bounded rank. In this paper we obtain 2-step growth results for representations of such groups $G$ (including…
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…
We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…
Grigorchuk and de la Harpe asked if there are many groups with growth exponent close to that of the free group with the same number of generators. We prove that this is in fact the case for a generic group (in the density model of random…
We exhibit examples of groups of intermediate growth with $2^{\aleph_0}$ ergodic, continuous, invariant random subgroups. The examples are the universal groups associated with a family of groups of intermediate growth.