On the complexity of the cogrowth sequence

DOI10.4171/JCA/39zbMath1481.20110arXiv1805.08118OpenAlexW3012225494MaRDI QIDQ2181189

Jason P. Bell, Marni Mishna

Publication date: 18 May 2020

Published in: Journal of Combinatorial Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.08118

zbMATH Keywords

amenabilitycogrowth\(D\)-finite power series\(P\)-recursive sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05) Random walks on graphs (05C81)

Related Items (1)

Cogrowth series for free products of finite groups

Cites Work

• Words in linear groups, random walks, automata and P-recursiveness
• On the transcendence of certain series
• Groups, the theory of ends, and context-free languages
• Gromov's theorem on groups of polynomial growth and elementary logic
• The accessibility of finitely presented groups
• Analytic models and ambiguity of context-free languages
• Differentiably finite power series
• Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
• Gevrey series of arithmetic type. I: Purity and duality theorems
• Nilpotent connections and the monodromy theorem: Applications of a result of Turrittin
• Symmetric Random Walks on Groups
• Subgroups of finitely presented groups
• On rationality of the cogrowth series
• A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS
• The cogrowth series for BS(N, N) is D-finite
• The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups
• Numerical studies of Thompson’s group F and related groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of the cogrowth sequence