SearcharxivSearch

arXiv · 1804.03010

Generators and presentations for direct and wreath products of monoid acts

Abstract

We investigate the preservation of the properties of being finitely generated and finitely presented under both direct and wreath products of monoid acts. A monoid $M$ is said to preserve property $\mathcal{P}$ in direct products if, for any two $M$-acts $A$ and $B$, the direct product $A\times B$ has property $\mathcal{P}$ if and only if both $A$ and $B$ have property $\mathcal{P}$. It is proved that the monoids $M$ that preserve finite generation (resp. finitely presentability) in direct products are precisely those for which the diagonal $M$-act $M\times M$ is finitely generated (resp. finitely presented). We show that a wreath product $A\wr B$ is finitely generated if and only if both $A$ and $B$ are finitely generated. It is also proved that a necessary condition for $A\wr B$ to be finitely presented is that both $A$ and $B$ are finitely presented. Finally, we find some sufficient conditions for a wreath product to be finitely presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Craig Miller. 2018-04-06. Generators and presentations for direct and wreath products of monoid acts. https://arxiv.org/abs/1804.03010

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