SearcharxivSearch

arXiv · 2210.06017

Remark on the identities of the grammic monoid with three generators

Abstract

Grammic monoids have recently been introduced by Christian Choffrut in terms of the action of the free monoid over a fixed ordered alphabet $X$ on the set of rows of Young tableaux filled with elements from $X$ via Schensted's insertion. For $X=\{a,b,c\}$ with $a<b<c$, Choffrut has identified the grammic monoid on $X$ with the quotient of the plactic monoid on $X$ over the congruence generated by the pair $(bacb,cbab)$. Since $cbab\ne bcab$ in the latter monoid, the quotient is proper. We show that, nevertheless, the plactic and the grammic monoids with three generators satisfy the same identities.

Explore related subjects

Keep this discovery

BibTeXRIS

Mikhail V. Volkov. 2022-10-12. Remark on the identities of the grammic monoid with three generators. https://arxiv.org/abs/2210.06017

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