SearcharxivSearch

arXiv · 1412.6662

The conjugacy problem for positive homogeneously presented monoids

Abstract

Let $M$ be a positive homogeneously presented monoid ${\langle L \mid R\,\rangle}_{mo}$. If $M$ satisfies the cancellation condition and carries certain particular elements similar to the \emph{fundamental elements} in Artin monoids, then the solvability of the conjugacy problem for $M$ implies that in the corresponding group ${\langle L \mid R\,\rangle}$. In addition to these conditions, if $M$ satisfies the LCM condition (i.e. any two elements $α$ and $β$ in $M$ admit the left (resp.~right) least common multiple), then the solution to the conjugacy problem for $M$ is known. We will give two kinds of examples that do not satisfy only the LCM condition. For these examples, we will give a solution to the conjugacy problem by improving the method given by E. Brieskorn and K. Saito.

Explore related subjects

Keep this discovery

BibTeXRIS

Tadashi Ishibe. 2014-12-20. The conjugacy problem for positive homogeneously presented monoids. https://arxiv.org/abs/1412.6662

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