2000 character limit reached
Elementary totally disconnected, locally compact groups of higher complexity
Published 20 Oct 2023 in math.GR | (2310.13239v1)
Abstract: The article focuses on a class of second countable groups assembled from profinite and discrete by elementary operations. We focus on a rank associated with these groups that measure their complexity, the decomposition rank. A collection of groups acting on $\aleph_0$-regular trees is defined and used for the first construction of a group with decomposition rank $\omega\omega+1$.
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.