A short proof of the Grigorchuk-Cohen cogrowth theorem
HTML articles powered by AMS MathViewer
- by Ryszard Szwarc PDF
- Proc. Amer. Math. Soc. 106 (1989), 663-665 Request permission
Abstract:
Let $G$ be a group generated by ${g_1}, \ldots ,{g_r}$. There are exactly $2r{(2r - 1)^{n - 1}}$ reduced words in ${g_1}, \ldots ,{g_r}$ of length $n$. Part of them, say ${\gamma _n}$ represents identity element of $G$. Let $\gamma = \lim \sup \gamma _n^{1/n}$. We give a short proof of the theorem of Grigorchuk and Cohen which states that $G$ is amenable if and only if $\gamma = 2r - 12$. Moreover we derive some new properties of the generating function $\sum {{\gamma _n}{z^n}}$.References
- Joel M. Cohen, Cogrowth and amenability of discrete groups, J. Funct. Anal. 48 (1982), no. 3, 301–309. MR 678175, DOI 10.1016/0022-1236(82)90090-8
- R. I. Grigorchuk, Symmetrical random walks on discrete groups, Multicomponent random systems, Adv. Probab. Related Topics, vol. 6, Dekker, New York, 1980, pp. 285–325. MR 599539
- Harry Kesten, Full Banach mean values on countable groups, Math. Scand. 7 (1959), 146–156. MR 112053, DOI 10.7146/math.scand.a-10568
- T. Pytlik, Radial functions on free groups and a decomposition of the regular representation into irreducible components, J. Reine Angew. Math. 326 (1981), 124–135. MR 622348, DOI 10.1515/crll.1981.326.124
- Ryszard Szwarc, An analytic series of irreducible representations of the free group, Ann. Inst. Fourier (Grenoble) 38 (1988), no. 1, 87–110 (English, with French summary). MR 949000
- Bjorn Poonen, Stan Wagon, Bradley Lucier, David K. Cohoon, Gary E. Stevens, and William Miller, Problems and Solutions: Elementary Problems: E3225-E3230, Amer. Math. Monthly 94 (1987), no. 8, 786–787. MR 1541174, DOI 10.2307/2323423
Additional Information
- © Copyright 1989 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 106 (1989), 663-665
- MSC: Primary 43A07; Secondary 20E99, 20F05, 22D05
- DOI: https://doi.org/10.1090/S0002-9939-1989-0975660-2
- MathSciNet review: 975660