The Asymptotic Dimension of the First Grigorchuk Group is Infinity
英文摘要：
We prove that the asymptotic dimension of the first Grigorchuk group is infinity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Portrait growth in contracting, regular branch groups
We address a question of Grigorchuk by providing both a system of recursive formulas and an asymptotic result for the portrait growth of the first Grigorchuk group. The results are obtained through analysis of some features of the branching subgroup structure of the group. More generally, we provide recursive formulas for the portrait growth of any finitely generated, contracting, regular branch group, based on the coset decomposition of the groups that are higher in the branching subgroup structure in terms of the lower subgroups. Using the same general approach we fully describe the portrait…
math.GR
On asymptotic dimension of groups
We prove a version of the countable union theorem for asymptotic dimension and we apply it to groups acting on asymptotically finite dimensional metric spaces. As a consequence we obtain the following finite dimensionality theorems. A) An amalgamated product of asymptotically finite dimensional groups has finite asymptotic dimension: asdim A *_C B < infinity. B) Suppose that G' is an HNN extension of a group G with asdim G < infinity. Then asdim G'< infinity. C) Suppose that Γis Davis' group constructed from a group πwith asdimπ< infinity. Then asdimΓ< infinity.
math.GRmath.GT
The firefighter problem on polynomial and intermediate growth groups
We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy $\{f(n)\}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that $Cn^{d-2}$ firefighters are enough, answering and strengthening a conjecture of Develin and Hartke. We also prove that intermediate growth Cayley graphs do not satisfy polynomial containment, and give explicit lower bounds depending on the growth rate of the group. These bounds can be further improved when more geometric information is available, such as for Grigo…
cs.DMmath.COmath.GR
