SearcharxivSearch

arXiv · 1910.09914

A Lyndon's identity theorem for one-relator monoids

Abstract

For every one-relator monoid $M = \langle A \mid u=v \rangle$ with $u, v \in A^*$ we construct a contractible $M$-CW complex and use it to build a projective resolution of the trivial module which is finitely generated in all dimensions. This proves that all one-relator monoids are of type ${\rm FP}_\infty$, answering positively a problem posed by Kobayashi in 2000. We also apply our results to classify the one-relator monoids of cohomological dimension at most $2$, and to describe the relation module, in the sense of Ivanov, of a torsion-free one-relator monoid presentation as an explicitly given principal left ideal of the monoid ring. In addition, we prove the topological analogues of these results by showing that all one-relator monoids satisfy the topological finiteness property ${\rm F}_\infty$, and classifying the one-relator moniods with geometric dimension at most $2$. These results give a natural monoid analogue of Lyndon's Identity Theorem for one-relator groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert D. Gray, Benjamin Steinberg. 2019-10-22. A Lyndon's identity theorem for one-relator monoids. https://arxiv.org/abs/1910.09914

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR