Abstract
We generalize free monoids by defining k-monoids. These are nothing other than the one-vertex higher-rank graphs used in C∗-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.
| Original language | English |
|---|---|
| Pages (from-to) | 167-185 |
| Number of pages | 19 |
| Journal | Semigroup Forum |
| Volume | 109 |
| Issue number | 1 |
| Early online date | 12 Jul 2024 |
| DOIs | |
| Publication status | Published - Aug 2024 |
Keywords
- Free monoids
- Higher rank graphs
- The Thompson–Higman groups
ASJC Scopus subject areas
- Algebra and Number Theory