2000 character limit reached
Generalizations of free monoids
Published 27 Mar 2024 in math.CT | (2403.18449v2)
Abstract: We generalize free monoids by defining $k$-monoids. These are nothing other than the one-vertex higher-rank graphs used in $C{\ast}$-algebra theory with the cardinality requirement waived. The $1$-monoids are precisely the free monoids. We then take the next step and generalize $k$-monoids in such a way that self-similar group actions yield monoids of this type.
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.