Words in linear groups, random walks, automata and P-recursiveness (Q528822): Difference between revisions
From MaRDI portal
Revision as of 19:29, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Words in linear groups, random walks, automata and P-recursiveness |
scientific article |
Statements
Words in linear groups, random walks, automata and P-recursiveness (English)
0 references
16 May 2017
0 references
Summary: Let \(S\) be a generating set of a finitely generated group \(G = \langle S \rangle\). Denote by \(a_n\) the number of words in \(S\) of length \(n\) that are equal to 1. We show that the \textit{cogrowth sequence} \(\{a_n\}\) is not always P-recursive. This is done by developing new combinatorial tools and using known results in computability and probability on groups.
0 references
cogrowth sequence of groups
0 references
probability of return
0 references
P-recursive sequences
0 references
linear groups
0 references
finite state automata
0 references
0 references
