Related papers: On groups with D-finite cogrowth series
We provide the first example of virtually nilpotent group, with a specific generating set, for which the Green series (sometimes called cogrowth series) is not $D$-finite. The proof relies on an arithmetical miracle, and the study of the…
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 the…
We compute the cogrowth series for Baumslag-Solitar groups $\mathrm{BS}(N,N) = < a,b | a^N b = b a^N > $, which we show to be D-finite. It follows that their cogrowth rates are algebraic numbers.
Schreier formula for the rank of a subgroup of finite index of a finitely generated free group $F$ is generalized to an arbitrary (even infinitely generated) subgroup $H$ through the Schreier transversals of $H$ in $F$. The rank formula may…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
We show that if a group contains $\mathbb{Z}^n \times F_m$ as a finite-index subgroup, then its cogrowth series is the diagonal of a rational function for every generating set. This answers a question of Pak and Soukup on the cogrowth of…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…
In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the…
We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.
Let k be a finite base field. In this note, making use of topological periodic cyclic homology and of the theory of noncommutative motives, we prove that the numerical Grothendieck group of every smooth proper dg k-linear category is a…
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 some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…