Metraipolis › archive › dc_8ec5fdcd9730

The Margolis-Rhodes Monoid of a Graph — arXiv:2609.39370

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39370
License (as archived)
CC0-1.0
Archived
2026-10-07T14:19:20.102Z
SHA-256 of the archived text
9c0f577568c5641ec4944cdb46bf9dd9762a54caf90cae8ecd0ee369c56e88b1
Stable URL of this page
https://metraipolis.com/documento/dc_8ec5fdcd9730

How to cite

The Margolis-Rhodes Monoid of a Graph — arXiv:2609.39370 — arXiv (en), https://arxiv.org/abs/2609.39370 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8ec5fdcd9730 (Metraipolis archive dc_8ec5fdcd9730, sha256 9c0f577568c5641ec4944cdb46bf9dd9762a54caf90cae8ecd0ee369c56e88b1)
BibTeX
@misc{dc8ec5fdcd9730,
  title = {The Margolis-Rhodes Monoid of a Graph — arXiv:2609.39370},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39370},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8ec5fdcd9730; sha256 9c0f577568c5641ec4944cdb46bf9dd9762a54caf90cae8ecd0ee369c56e88b1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39370. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We investigate the structural, combinatorial, ideal-theoretic and Krohn-Rhodes complexity of the Margolis-Rhodes monoid, MR(G), of a finite simple graph G, viewed topologically as a 1-dimensional simplicial complex. Alongside the full monoid, we examine some subsemigroups including St(G), defined by the condition that the full inverse image is an edge or the empty set and Inj(G), the monoid of all partial 1-1 continuous functions. We provide explicit combinatorial enumerations and struture for paths and cycles. We compute Green's relations showing in particular that the partial order of regular J-classes is isomorphic to the poset of induced subgraphs of G. Finally, we apply these structural invariants to Krohn-Rhodes complexity theory. It is known that the Margolis-Rhodes monoid has complexity at most 2 and 1 for St(G) and Inj(G). We show that for cycles the complexity of its Margolis-Rhodes monoid is 2 if and only if the cycle is of length at least 4. For paths, we prove that the complexity of its Margolis-Rhodes monoid is 2 if the path length is at least 13.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: Group Theory (math.GR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.39370 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:05:16.455Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).