SearcharxivSearch

arXiv · 1712.06022

Homogeneous finitely presented monoids of linear growth

Abstract

If a finitely generated monoid M is defined by a finite number of degree-preserving relations, then it has linear growth if and only if it can be decomposed into a finite disjoint union of subsets (which we call "sandwiches") of the form $a b$, where $a,b,w$ are elements of $M$ and $ $ denotes the monogenic semigroup generated by $w$. Moreover, the decomposition can be chosen in such a way that the sandwiches are either singletons or "free" ones (meaning that all elements $a w^n b$ in each sandwich are pairwise different). So, the minimal number of free sandwiches in such a decomposition is a numerical invariant of a homogeneous (and conjecturally, non-homogeneous) finitely presented monoid of linear growth.

Explore related subjects

Keep this discovery

BibTeXRIS

Dmitri Piontkovski. 2017-12-16. Homogeneous finitely presented monoids of linear growth. https://arxiv.org/abs/1712.06022

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