SearcharxivSearch

arXiv · 1709.08916

An introduction to presentations of monoid acts: quotients and subacts

Abstract

The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act $A$ and a subact $B$ of $A$, on the one hand we construct presentations for $B$ and the Rees quotient $A/B$ using a presentation for $A$, and on the other hand we derive a presentation for $A$ from presentations for $B$ and $A/B$. We also construct a general presentation for the union of two subacts. From our general presentations, we deduce a number of finite presentability results. Finally, we consider the case where a subact $B$ has finite complement in an $M$-act $A$. We show that if $M$ is a finitely generated monoid and $B$ is finitely presented, then $A$ is finitely presented. We also show that if $M$ belongs to a wide class of monoids, including all finitely presented monoids, then the converse also holds.

Explore related subjects

Keep this discovery

BibTeXRIS

Craig Miller, Nik Ruskuc. 2017-09-26. An introduction to presentations of monoid acts: quotients and subacts. https://arxiv.org/abs/1709.08916

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