Related papers: Growth of groups with linear Schreier graphs
We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G. In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair (G, H).…
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and M\"uller on these graphs and how to repair this lemma.
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
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…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any…
$\omega$-periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are ameanable.…
We construct a family of finite special 2-groups which have commuting graph of increasing diameter
In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier…
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
We develop further Cannon's method of cone types for finding the growth function of a group, which can also be used to find the coordination sequences of certain infinite graphs. We then apply this method to compute the growth functions and…
Given a finitely generated, torsion-free nilpotent group, we find the maximum possible (critical) regularity for its faithful actions by diffeomorphisms of the closed or half-open interval and of the circle. Our result gives an expression…
We give a short introduction to the subject of representation growth and representation zeta functions of groups, omitting all proofs. Our focus is on results which are relevant to the study of arithmetic groups in semisimple algebraic…
For a finitely generated group $\Gamma$ denote by $\mu(\Gamma)$ the growth coefficient of $\Gamma$, that is, the infimum over all real numbers $d$ such that $s_n(\Gamma)<n!^d$. We show that the growth coefficient of a virtually free group…
Following ideas that go back to Cannon, we show the rationality of various generating functions of growth sequences counting embeddings of convex subgraphs in locally-finite, vertex-transitive graphs with the (relative) falsification by…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We prove that torsion in the abelianizations of open normal subgroups in finitely presented pro-$p$ groups can grow arbitrarily fast. By way of contrast in $\mathbb Z_p$- analytic groups the torsion growth is at most polynomial.
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.