A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley graphs of finitely presented special monoids, building on work by Zhang and Gray-Steinberg. It is shown that the right Cayley graph $Γ$ of a special monoid $M$ is a context-free graph, in the sense of Muller & Schupp, if and only if the group of units of $M$ is virtually free. This generalises the geometric aspect of the well-known Muller-Schupp Theorem from groups to special monoids. Furthermore, we completely characterise when the monadic second order theory of $Γ$ is decidable: this is precisely when the group of units is virtually free. This completely answers for the class of special monoids a question of Kuske & Lohrey from 2006. As a corollary, we obtain that the rational subset membership problem for $M$ is decidable when the group of units of $M$ is virtually free, extending results of Kambites & Render. We also show that the class of special monoids with virtually free group of units is the same as the class of special monoids with right Cayley graph quasi-isometric to a tree as undirected graphs. The above results are proven by developing two general constructions for graphs which preserve context-freeness, of independent interest. The first takes a context-free graph and constructs a tree of copies of this graph. The second is a bounded determinisation of the resulting tree of copies.
A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, for special monoids in terms of their group of units. We prove that a special monoid has context-free word problem if and only if its group of units is virtually free, giving a full generalisation of the Muller-Schupp theorem. This fully answers, for the class of special monoids, a question posed by Duncan & Gilm…
We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a completely regular or a commutative variety. Finally, we verify that all commutative varieties of monoids are codistributive elements of $\mathbb{MON}$. Thus, the problems of describing codistributive or upper-modular elements of $\mathbb{MON}$ are completely reduced to the completely regular case.
On Special Inverse Monoids with the Strong $F$-Inverse Property
University of Novi Sad（诺维萨德大学）；Faculty of Mathematics and Physics, University of Ljubljana（卢布尔雅那大学数学物理学院）；Institute of Mathematics, Physics and Mechanics（数学、物理与力学研究所）
The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special monoid $M$ with trivial group of units, and such that the Diophantine problem is undecidable in $M$. This answers two questions asked by Garreta & Gray in 2019, and shows that the decidability of the Diophantine problem in hyperbolic groups, as proved by Dahmani & Guirardel, does not generalise to word-hyperbolic monoids.
This note investigates and clarifies some connections between the theory of one-relator groups and special one-relation inverse monoids, i.e. those inverse monoids with a presentation of the form $\operatorname{Inv}\langle A \mid w=1 \rangle$. We show that every one-relator group admits a special one-relation inverse monoid presentation. We subsequently consider the classes ${\rm {\small ANY}}, {\rm {\small RED}}, {\rm {\small CRED}},$ and ${\rm {\small POS}}$ of one-relator groups which can be defined by special one-relation inverse monoid presentations in which the defining word is arbitrary…
This is the second in a series of papers that develops the theory of reflection monoids, motivated by the theory of reflection groups. Reflection monoids were first introduced in arXiv:0812.2789. In this paper we study their presentations as abstract monoids. Along the way we also find general presentations for certain join-semilattices (as monoids under join) which we interpret for two special classes of examples: the face lattices of convex polytopes and the geometric lattices, particularly the intersection lattices of hyperplane arrangements. Another spin-off is a general presentation for t…
In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system $\Re$ that satisfies the condition that each rule in $\Re$ with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from $\Re$ embeds in the group. As an example, we give a simple proof that right angled Artin monoids embed in the corresponding right angled Artin groups. This is a special case of the well-known result of Paris \cite{paris} that Artin m…
A topological semigroup is monothetic provided it contains a dense cyclic subsemigroup. The Koch problem asks whether every locally compact monothetic monoid is compact. This problem was opened for more than sixty years, till in 2018 Zelenyuk obtained a negative answer. In this paper we obtain a positive answer for Koch's problem for some special classes of topological monoids. Namely, we show that a locally compact monothetic topological monoid is a compact topological group if and only if $S$ is a submonoid of a quasitopological group if and only if $S$ has open shifts if and only if $S$ is …
Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis--Meakin expansions of groups. Given a finite-above $E$-unitary inverse monoid $M$ and a group variety $\mathit{U}$, we find a condition for $M$ and $\mathit{U}$, involving a construction of descending chains of graphs, which is equivalent to $M$ having an $F$-inverse cover via $\mathit{U}$. In the special case where $\mathit{U}=\mathit{Ab}$, the variety of Abelian groups, we apply this condition to get a simple sufficient condition for $M$ to have no $F$-inverse cover via $\mathit{Ab}$, formulated b…
In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership problem for a number of classes of one-relator groups which are low in the Magnus-Moldavanski\uı hierarchy. Since the prefix membership problem for one-relator groups is intimately related to the word problem for one-relator special inverse monoids in the $E$-unitary case (as discovered in 2001 by Ivanov, Margolis and Meakin), these results yield solutions o…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups contains the braid groups, all spherical Artin groups, and various generalizations previously considered (In particular, the Garside groups considered in [1,7] are special cases of those considered here; the latter had been called "small Gaussian" in earlier works; the name has been changed in order to uniformize the terminology with works by Bessis, Charney, Mi…
In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of sets accepted by special automata or special monoids. These automata allow us to compute explicitly generating functions, $λ-$measures and Cesaro measure of thick monoids. Also we improve the asymptotic classification of regular subsets in free groups.
Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph for the $q$-analogue of the special linear Lie algebra $\mathfrak{sl}_{n}$, this monoid is the celebrated plactic monoid, whose elements can be identified with Young tableaux. The crystal graph and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson--Schensted--Knuth correspondence and so prov…
We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical matrices. In the case $n=2$ these identities are precisely those satisfied by the bicyclic monoid, whilst in the case $n=3$ they form a subset of the identities which hold in the plactic monoid of rank $3$. To each word we associate a signature sequence of lattice polytopes, and show that two words form an identity for $\ut{n}$ if and only if their signatures a…
