Explicit universal minimal constants for polynomial growth of groups

@article{Lyons2022ExplicitUM,
  title={Explicit universal minimal constants for polynomial growth of groups},
  author={Russell Lyons and Avinoam Mann and Romain Tessera and Matthew C. H. Tointon},
  journal={Journal of Group Theory},
  year={2022},
  volume={0}
}
Abstract Shalom and Tao showed that a polynomial upper bound on the size of a single, large enough ball in a Cayley graph implies that the underlying group has a nilpotent subgroup with index and degree of polynomial growth both bounded effectively. The third and fourth authors proved the optimal bound on the degree of polynomial growth of this subgroup, at the expense of making some other parts of the result ineffective. In the present paper, we prove the optimal bound on the degree of… 
1 Citations
Locality of percolation for graphs with polynomial growth
Schramm’s Locality Conjecture asserts that the value of the critical percolation parameter p c of a graph satisfying p c < 1 depends only on its local structure. In this note, we prove this

References

SHOWING 1-10 OF 42 REFERENCES
A Finitary Version of Gromov’s Polynomial Growth Theorem
We show that for some absolute (explicit) constant C, the following holds for every finitely generated group G, and all d > 0: If there is someR0 > exp(exp(CdC)) for which the number of elements in a
Finite linear groups and theorems of Minkowski and Schur
Let G be a finite group with a faithful rational valued character of degree n. A theorem of I. Schur gives a bound for the order of G in terms of n, generalizing an earlier result of H. Minkowski who
Rational and transcendental growth series for the higher Heisenberg groups
Abstract. This paper considers growth series of 2-step nilpotent groups with infinite cyclic derived subgroup. Every such group G has a subgroup of finite index of the form Hn×ℤm, where Hn is the
A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth
We prove a quantitative, finitary version of Trofimov’s result that a connected, locally finite vertex-transitive graph Γ of polynomial growth admits a quotient with finite fibres on which the action
GRAPHS WITH POLYNOMIAL GROWTH
Let be a connected locally finite vertex-symmetric graph, the number of vertices of at a distance not more than from some fixed vertex. The equivalence of the following assertions is proved:(a) is
The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups
It will be convenient to say that a group G virtually has a property P if some subgroup of finite index has property P. Thus the theorem above concludes that 'G is virtually nilpotent'. (This
Properness of nilprogressions and the persistence of polynomial growth of given degree
We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of Bilu's result that a
The structure of approximate groups
Let K⩾1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A⋅A is covered by K left translates of A.The main result of
A new proof of Gromov's theorem on groups of polynomial growth
We give a new proof of Gromov’s theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. The proof does not rely on the MontgomeryZippin-Yamabe structure
The Structure of Locally Compact Approximate Groups
Author(s): Carolino, Pietro Kreitlon | Advisor(s): Tao, Terence C | Abstract: A subset A of a locally compact group G is said to be a K-approximate group if it contains the identity, is closed under
...
...