Words in linear groups, random walks, automata and P-recursiveness
Journal of Combinatorial Algebra · 2017
DOI: 10.4171/jca/1-2-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Algebra, 2017. Verfasst von Scott Garrabrant und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
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 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.
Zitieren
APA
Garrabrant, S., & Pak, I. (2017). Words in linear groups, random walks, automata and P-recursiveness. Journal of Combinatorial Algebra. https://doi.org/10.4171/jca/1-2-1
Vancouver
Garrabrant S, Pak I. Words in linear groups, random walks, automata and P-recursiveness. Journal of Combinatorial Algebra. 2017. doi:10.4171/jca/1-2-1
BibTeX
@article{Garrabrant2017,
author = {Garrabrant, Scott and Pak, Igor},
title = {Words in linear groups, random walks, automata and P-recursiveness},
journal = {Journal of Combinatorial Algebra},
year = {2017},
doi = {10.4171/jca/1-2-1}
}
EUVIMED