SearcharxivSearch

arXiv · 2210.16123

On the Dehn functions of a class of monadic one-relation monoids

Abstract

We give an infinite family of monoids $Π_N$ (for $N=2, 3, \dots$), each with a single defining relation of the form $bUa = a$, such that the Dehn function of $Π_N$ is at least exponential. More precisely, we prove that the Dehn function $\partial_N(n)$ of $Π_N$ satisfies $\partial_N(n) \succeq N^{n/4}$. This answers negatively a question posed by Cain & Maltcev in 2013 on whether every monoid defined by a single relation of the form $bUa=a$ has quadratic Dehn function. Finally, by using the decidability of the rational subset membership problem in the metabelian Baumslag--Solitar groups $\operatorname{BS}(1,n)$ for all $n \geq 2$, proved recently by Cadilhac, Chistikov & Zetzsche, we show that each $Π_N$ has decidable word problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carl-Fredrik Nyberg-Brodda. 2022-10-28. On the Dehn functions of a class of monadic one-relation monoids. https://arxiv.org/abs/2210.16123

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