Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1910.02134

Eraser morphisms and membership problem in groups and monoids

Daniele D'Angeli·Emanuele Rodaro·Pedro V. Silva·Alexander Zakharov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case, and show that it has decidable membership problem. We establish several algorithmic properties of the class of finite-${\cal{J}}$-above (inverse) monoids. We prove that the image of the eraser morphism in the free inverse monoid case (and more generally, in the finite-${\cal{J}}$-above case) has decidable membership problem, and relate its kernel to the free group fragile words.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Daniele D'Angeli, Emanuele Rodaro, Pedro V. Silva, Alexander Zakharov. 2019-10-04. Eraser morphisms and membership problem in groups and monoids. https://arxiv.org/abs/1910.02134

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↗