2000 character limit reached
Rooted trees, strong cofinality and ample generics
Published 20 Oct 2011 in math.GR and math.LO | (1110.4511v1)
Abstract: We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.
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.