We investigate systems of equations and the first-order theory of one-relator monoids. We describe a family $\mathcal{F}$ of one-relator monoids of the form $\langle A\mid w=1\rangle$ where for each monoid $M$ in $\mathcal{F}$, the longstanding open problem of decidability of word equations with length constraints reduces to the Diophantine problem (i.e.\ decidability of systems of equations) in $M$. We achieve this result by finding an interpretation in $M$ of a free monoid, using only systems of equations together with length relations. It follows that each monoid in $\mathcal{F}$ has undecidable positive AE-theory, hence in particular it has undecidable first-order theory. The family $\mathcal{F}$ includes many one-relator monoids with torsion $\langle A\mid w^n = 1\rangle$ ($n>1$). In contrast, all one-relator groups with torsion are hyperbolic, and all hyperbolic groups are known to have decidable Diophantine problem. We further describe a different class of one-relator monoids with decidable Diophantine problem.
We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first of these results answers a problem originally posed by Margolis, Meakin and Stephen in 1987.
For every one-relator monoid $M = \langle A \mid u=v \rangle$ with $u, v \in A^*$ we construct a contractible $M$-CW complex and use it to build a projective resolution of the trivial module which is finitely generated in all dimensions. This proves that all one-relator monoids are of type ${\rm FP}_\infty$, answering positively a problem posed by Kobayashi in 2000. We also apply our results to classify the one-relator monoids of cohomological dimension at most $2$, and to describe the relation module, in the sense of Ivanov, of a torsion-free one-relator monoid presentation as an explicitly g…
We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the set of words in (X \cup X^{-1})^* that represent the identity in M is a deterministic context free language, and that the set of geodesics in the Schutzenberger graph of the identity of M is a regular language.
We study C*-algebras generated by left regular representations of right LCM one-relator monoids and Artin-Tits monoids of finite type. We obtain structural results concerning nuclearity, ideal structure and pure infiniteness. Moreover, we compute K-theory. Based on our K-theory results, we develop a new way of computing K-theory for certain group C*-algebras and crossed products.
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…
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…
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 aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether the word problem for one-relator monoids is soluble.
The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set $A=\{a_1,a_2,\dots,a_n\},\ n\in \mathbb{N}$ with defining relation $u=v$, where $u,v\in A^*$ and $A^*$ is the free monoid generated by $A$. Such a semigroup is called a one-relator semigroup. Suppose that $|v|\leq|u|\leq3$, where $|u|$ is the length of the word $u$. Suppose that $a,b\in A,\ a\neq b$. Then we have the following: (1) $S$ is prefix-automatic if $u=v\not\in \{ab…
Exponential equations in free groups were studied initially by Lyndon and Schutzenberger and then by Comerford and Edmunds. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential equations have solution is decidable, in finitely generated free groups. In this paper we show that for finite systems of quadratic exponential equations decidability passes, under certain hypotheses, from the factor groups to free products and one-relator products.
Adding two generators and one arbitrary relator to a nontrivial torsion-free group, we always obtain an SQ-universal group. In the course of the proof of this theorem, we obtain some other results of independent interest. For instance, adding one generator and one relator in which the exponent sum of the additional generator is one to a free product of two nontrivial torsion-free groups, we also obtain an SQ-universal group. Key words: relative presentations, one-relator groups, SQ-universality, equations over groups.
We prove that an inverse-free equation is valid in the variety LG of lattice-ordered groups (l-groups) if and only if it is valid in the variety DLM of distributive lattice-ordered monoids (distributive l-monoids). This contrasts with the fact that, as proved by Repnitskii, there exist inverse-free equations that are valid in all Abelian l-groups but not in all commutative distributive l-monoids, and, as we prove here, there exist inverse-free equations that hold in all totally ordered groups but not in all totally ordered monoids. We also prove that DLM has the finite model property and a dec…
We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the Reidemeister--Schreier method, together with general recent results by Dahmani & Guirardel and Ciobanu, Holt & Rees on the decidability of the Diophantine problem in general classes of groups. First, we give a sample of the methods of the article by proving that the one-relator group with defining relation $a^mb^n = 1$ is virtually a direct product of hyperbolic gro…
One of the results in our article, which appeared in Publ. Mat. 65 (2021), 499--528, is that the structure monoid $M(X,r)$ of a left non-degenerate solution $(X,r)$ of the Yang-Baxter Equation is a left semi-truss, in the sense of Brzeziński, with an additive structure monoid that is close to being a normal semigroup. Let $η$ denote the least left cancellative congruence on the additive monoid $M(X,r)$. It is then shown that $η$ also is a congruence on the multiplicative monoid $M(X,r)$ and that the left cancellative epimorphic image $\bar{M}=M(X,r)/η$ inherits a semi-truss structure and thus …
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.
Given a finite bijective non-degenerate set-theoretic solution $(X,r)$ of the Yang--Baxter equation we characterize when its structure monoid $M(X,r)$ is Malcev nilpotent. Applying this characterization to solutions coming from racks, we rediscover some results obtained recently by Lebed and Mortier, and by Lebed and Vendramin on the description of finite abelian racks and quandles. We also investigate bijective non-degenerate multipermutation (not necessarily finite) solutions $(X,r)$ and show, for example, that this property is equivalent to the solution associated to the structure monoid $M…
The aim of this paper is to present a PSPACE algorithm which yields a finite graph of exponential size and which describes the set of all solutions of equations in free groups as well as the set of all solutions of equations in free monoids with involution in the presence of rational constraints. This became possible due to the recently invented emph{recompression} technique of the second author. He successfully applied the recompression technique for pure word equations without involution or rational constraints. In particular, his method could not be used as a black box for free groups (even…
We exhibit a faithful representation of the stylic monoid of every finite rank as a monoid of upper unitriangular matrices over the tropical semiring. Thus, we show that the stylic monoid of finite rank $n$ generates the pseudovariety $\boldsymbol{\mathcal{J}}_n$, which corresponds to the class of all piecewise testable languages of height $n$, in the framework of Eilenberg's correspondence. From this, we obtain the equational theory of the stylic monoids of finite rank, show that they are finitely based if and only if $n \leq 3$, and that their identity checking problem is decidable in linear…
Given a right-non-degenerate set-theoretic solution $(X,r)$ to the Yang-Baxter equation, we construct a whole family of YBE solutions $r^{(k)}$ on $X$ indexed by its reflections $k$ (i.e., solutions to the reflection equation for $r$). This family includes the original solution and the classical derived solution. All these solutions induce isomorphic actions of the braid group/monoid on $X^n$. The structure monoids of $r$ and $r^{(k)}$ are related by an explicit bijective $1$-cocycle-like map. We thus turn reflections into a tool for studying YBE solutions, rather than a side object of study. …
It is well known that the problem solving equations in virtually free groups can be reduced to the problem of solving twisted word equations with regular constraints over free monoids with involution. In this paper we prove that the set of all solutions of a twisted word equation is an EDT0L language whose specification can be computed in $\mathsf{PSPACE}$. Within the same complexity bound we can decide whether the solution set is empty, finite, or infinite. In the second part of the paper we apply the results for twisted equations to obtain in $\mathsf{PSPACE}$ an EDT0L description of the sol…
