Gcd-monoids arising from homotopy groupoids
Friedrich Wehrung (LMNO)

TL;DR
This paper investigates the algebraic structure of interval monoids derived from posets, characterizing when they are gcd-monoids and exploring their embeddings into free monoids and groups, with implications for category theory.
Contribution
It provides new characterizations of gcd-monoids from posets, constructs examples with arbitrary groups as free factors, and extends results to universal monoids of categories.
Findings
Upsilon(P) is a gcd-monoid iff principal ideals/filters are join/meet-semilattices.
Every group G can be realized as a free factor of a gcd-monoid from a length-2 poset.
Finite posets yield monoids embeddable into free monoids.
Abstract
The interval monoid (P) of a poset P is defined by generators [x, y], where x y in P , and relations [x, x] = 1, [x, z] = [x, y] [y, z] for x y z. It embeds into its universal group (P), the interval group of P , which is also the universal group of the homotopy groupoid of the chain complex of P. We prove the following results: The monoid (P) has finite left and right greatest common divisors of pairs (we say that it is a gcd-monoid) iff every principal ideal (resp., filter) of P is a join-semilattice (resp., a meet-semilattice). For every group G, there is a poset P of length 2 such that (P) is a gcd-monoid and G is a free factor of (P) by a free group. Moreover, P can be taken finite iff G is finitely presented. For every finite poset P , the monoid (P)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Homotopy and Cohomology in Algebraic Topology
