On the complexity of the cogrowth sequence

  title={On the complexity of the cogrowth sequence},
  author={Jason P. Bell and Marni Mishna},
  journal={Journal of Combinatorial Algebra},
  • J. Bell, M. Mishna
  • Published 21 May 2018
  • Mathematics
  • Journal of Combinatorial Algebra
Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks in a Cayley graph with steps from $S$. We prove that the cogrowth sequence is not P-recursive when $G$ is an amenable group of superpolynomial growth, answering a question of Garrabant and Pak. In addition, we compute the cogrowth for certain infinite families of… 

Tables from this paper

Cogrowth Series for Free Products of Finite Groups
Given a finitely generated group with generating set S, we study the cogrowth sequence, which is the number of words of length n over the alphabet S that are equal to one. This is related to the
Selected problems in enumerative combinatorics: permutation classes, random walks and planar maps
In this thesis we consider a number of enumerative combinatorial problems. We solve the problems of enumerating Eulerian orientations by edges and quartic Eulerian orientations counted by vertices.
Lattice walks at the Interface of Algebra, Analysis and Combinatorics
Lattice paths are a classic object of mathematics, with applications in a wide range of areas including combinatorics, theoretical computer science and queuing theory. In the past ten years, several
Transport in Unsteady Flows: from Deterministic Structures to Stochastic Models and Back Again (17w5048)
Infinite-Dimensional Systems Infinite-dimensional system theory is an area where the goal is to axiomatize certain properties in control theory within the context of infinite-dimensional theory with


Cogrowth series of free products of finite and free groups
  • D. Kuksov
  • Mathematics
    Glasgow Mathematical Journal
  • 1999
Let A={a1,…,an,a1−1,…,an−1} and iteration of A denoted by A[starf ] to be the set of words in A (including the empty word). Let S⊆A[starf ]; then the growth function of the set S is the function
Words in Linear Groups, Random Walks, Automata and P-Recursiveness
Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always
On Cogrowth, Amenability, and the Spectral Radius of a Random Walk on a Semigroup
We introduce two natural notions of cogrowth for finitely generated semigroups —one local and one global — and study their relationship with amenability and random walks. We establish the minimal
The modular group and words in its two generators*
Consider the full modular group PSL2(ℤ) with presentation 〈U, S|U3, S2〉. Motivated by our investigations on quasi-modular forms and the Minkowski question mark function (so that this paper may be
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
Numerical studies of Thompson's group F and related groups
Improved rigorous lower bounds on the growth-rate of the cogrowth series for Thompson’s group F are presented and it is proved that, if the group is amenable, there cannot be a sub-dominant stretched exponential term in the asymptotics.
Subgroups of finitely presented groups
  • G. Higman
  • Mathematics
    Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
  • 1961
The main theorem of this paper states that a finitely generated group can be embedded in a finitely presented group if and only if it has a recursively enumerable set of defining relations. It
On the transcendence of certain series