Holonomy theorem for finite semigroups
DOI10.1142/S0218196722500217WikidataQ113777360 ScholiaQ113777360MaRDI QIDQ5075701FDOQ5075701
Authors: Anne Schilling, John L. Rhodes, Pedro V. Silva 
Publication date: 11 May 2022
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.15552
Recommendations
- Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
- HOLONOMY EMBEDDING OF ARBITRARY STABLE SEMIGROUPS
- Further results on monoids acting on trees.
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
- The Krohn-Rhodes theorem and local divisors
Representation of semigroups; actions of semigroups on sets (20M30) Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Regular semigroups (20M17)
Cites Work
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- The \(\mathfrak q\)-theory of finite semigroups.
- Codes and automata.
- Directed nonabelian sandpile models on trees
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- Unified theory for finite Markov chains
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
- Abstract length functions in groups
- Random walks on semaphore codes and delay de Bruijn semigroups
- Further results on monoids acting on trees.
- Yet another proof of the cascade decomposition theorem for finite automata: Correction
- The semaphore codes attached to a Turing machine via resets and their various limits
Cited In (5)
This page was built for publication: Holonomy theorem for finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075701)
