Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.00950

Algorithmic properties of inverse monoids with hyperbolic and tree-like Sch\"utzenberger graphs

Robert D. Gray·Pedro V. Silva·Nóra Szakács
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free. On the other hand, we show that there is a finitely presented inverse monoid with hyperbolic Sch\"utzenberger graphs and an unsolvable word problem.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Robert D. Gray, Pedro V. Silva, Nóra Szakács. 2019-12-02. Algorithmic properties of inverse monoids with hyperbolic and tree-like Sch\"utzenberger graphs. https://arxiv.org/abs/1912.00950

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗