2000 character limit reached
Pattern closure of groups of tree automorphisms
Published 8 Dec 2010 in math.GR | (1012.1688v2)
Abstract: It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its level s stabilizer. As an application, it is shown that there are no infinite, finitely constrained, topologically finitely generated groups of binary tree automorphisms defined by forbidden patterns of size two.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.