Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.02787

Gcd-monoids arising from homotopy groupoids

Friedrich Wehrung
View original source ↗Read source document ↗Export metadata ↓

Abstract

The interval monoid $Υ$(P) of a poset P is defined by generators [x, y], where x $\le$ y in P , and relations [x, x] = 1, [x, z] = [x, y] $\times$ [y, z] for x $\le$ y $\le$ z. It embeds into its universal group $Υ$ $\pm$ (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: $\bullet$ 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). $\bullet$ 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 $Υ$ $\pm$ (P) by a free group. Moreover, P can be taken finite iff G is finitely presented. $\bullet$ For every finite poset P , the monoid $Υ$(P) can be embedded into a free monoid. $\bullet$ Some of the results above, and many related ones, can be extended from interval monoids to the universal monoid Umon(S) of any category S. This enables us, in particular, to characterize the embeddability of Umon(S) into a group, by stating that it holds at the hom-set level. We thus obtain new easily verified sufficient conditions for embeddability of a monoid into a group. We illustrate our results by various examples and counterexamples.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Friedrich Wehrung. 2018-05-16. Gcd-monoids arising from homotopy groupoids. https://arxiv.org/abs/1712.02787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR↗
arXiv2026

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR↗
arXiv2026

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗