We investigate semigroups S which have the property that every subsemigroup of $S\times S$ which contains the diagonal $\{ (s,s)\colon s\in S\}$ is necessarily a congruence on S. We call such an S a DSC semigroup. It is well known that all finite groups are DSC, and easy to see that every DSC semigroup must be simple. Building on this, we show that for broad classes of semigroups, including periodic, stable, inverse and several well-known types of simple semigroups, the only DSC members are groups. However, it turns out that there exist nongroup DSC semigroups, which we obtain by utilising a construction introduced by Byleen for the purpose of constructing interesting congruence-free semigroups. Such examples can additionally be regular or bisimple.

This article is the second in a series investigating cartesian closed varieties. In first of these, we showed that every non-degenerate finitary cartesian variety is a variety of sets equipped with an action by a Boolean algebra B and a monoid M which interact to form what we call a matched pair ${\left[\smash{{B} \mathbin{\mid}{M} }\right]}$. In this article, we show that such pairs ${\left[\smash{{B} \mathbin{\mid}{M} }\right]}$ are equivalent to Boolean restriction monoids and also to ample source-étale topological categories; these are generalizations of the Boolean inverse monoids and ample étale topological groupoids used to encode self-similar structures such as Cuntz and Cuntz–Krieger $C^\ast$-algebras, Leavitt path algebras, and the $C^\ast$-algebras associated with self-similar group actions. We explain and illustrate these links and begin the programme of understanding how topological and algebraic properties of such groupoids can be understood from the logical perspective of the associated varieties.

In this paper, we characterise all maximal elements in the semigroup $S(X,Y)=\{f\in T(X) : f(Y)\subseteq Y\}$ with respect to the natural partial order. Our results correct an error in the work of Sun and Wang [‘Natural partial order in semigroups of transformations with invariant set’, Bull. Aust. Math. Soc. 87(1) (2013), 94–107].

We give a complete description of Rees quotients of free inverse semigroups given by positive relators that satisfy nontrivial identities, including identities in signature with involution. They are finitely presented in the class of all inverse semigroups. Those that satisfy a nontrivial semigroup identity have polynomial growth and can be given by an irredundant presentation with at most four relators. Those that satisfy a nontrivial identity in signature with involution, but which do not satisfy a nontrivial semigroup identity, have exponential growth and fall within two infinite families of finite presentations with two generators. The first family involves an unbounded number of relators and the other involves presentations with at most four relators of unbounded length. We give a new sufficient condition for which a finite set X of reduced words over an alphabet $A\cup A^{-1}$ freely generates a free inverse subsemigroup of $FI_A$ and use it in our proofs.

Given a presentation of a monoid $M$, combined work of Pride and of Guba and Sapir provides an exact sequence connecting the relation bimodule of the presentation (in the sense of Ivanov) with the first homology of the Squier complex of the presentation, which is naturally a $\mathbb ZM$-bimodule. This exact sequence was used by Kobayashi and Otto to prove the equivalence of Pride’s finite homological type property with the homological finiteness condition bi-$\mathrm {FP}_3$. Guba and Sapir used this exact sequence to describe the abelianization of a diagram group. We prove here a generalization of this exact sequence of bimodules for presentations of associative algebras. Our proof is more elementary than the original proof for the special case of monoids.

This paper studies reversibility and transitivity of semigroups acting on homogeneous spaces. Properties of the reversor set of a subsemigroup acting on homogeneous spaces are presented. Let G be a topological group and L a subgroup of G. Assume that S is a subsemigroup of G with nonempty interior. It is presented a study of the reversibility of the S-action on $G/L$ in terms of the actions of S and L on homogeneous spaces of G. The results relate the reversibility and the transitivity of S in $G/L$ with the minimality of the action of L on homogeneous spaces of G. In addition, sufficient conditions for S to be right reversible in G if S is reversible in $G/L$ are presented.

Motivated by approaches to the word problem for one-relation monoids arising from work of Adian and Oganesian (1987), Guba (1997), and Ivanov, Margolis, and Meakin (2001), we study the submonoid and rational subset membership problems in one-relation monoids and in positive one-relator groups. We give the first known examples of positive one-relator groups with undecidable submonoid membership problem, and we apply this to give the first known examples of one-relation monoids with undecidable submonoid membership problem. We construct several infinite families of one-relation monoids with undecidable submonoid membership problem, including examples that are defined by relations of the form $w=1$ but which are not groups, and examples defined by relations of the form $u=v$ where both of u and v are nonempty. As a consequence, we obtain a classification of the right-angled Artin groups that can arise as subgroups of one-relation monoids. We also give examples of monoids with a single defining relation of the form $aUb = a$ and examples of the form $aUb=aVa$, with undecidable rational subset membership problem. We give a one-relator group defined by a freely reduced word of the form $uv^{-1}$ with $u, v$ positive words, in which the prefix membership problem is undecidable. Finally, we prove the existence of a special two-relator inverse monoid with undecidable word problem, and in which both the relators are positive words. As a corollary, we also find a positive two-relator group with undecidable prefix membership problem. In proving these results, we introduce new methods for proving undecidability of the rational subset membership problem in monoids and groups, including by finding suitable embeddings of certain trace monoids.

We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound (the conductor). For many numerical semigroups, including all symmetric numerical semigroups, our upper bound is tight. Our construction uses combinatorially structured matrices and is parametrised by Kunz coordinates, which are central to enumerative problems in the study of numerical semigroups.

The monogenic free inverse semigroup $FI_1$ is not finitely presented as a semigroup due to the classic result by Schein (1975). We extend this result and prove that a finitely generated subsemigroup of $FI_1$ is finitely presented if and only if it contains only finitely many idempotents. As a consequence, we derive that an inverse subsemigroup of $FI_1$ is finitely presented as a semigroup if and only if it is a finite semilattice.

We give an explicit formula for the Frobenius number of triples associated with the Diophantine equation $x^2+y^2=z^3$, that is, the largest positive integer that can only be represented in p ways by combining the three integers of the solutions of $x^2+y^2=z^3$. For the equation $x^2+y^2=z^2$, the Frobenius number has already been given. Our approach can be extended to the general equation $x^2+y^2=z^r$ for $r>3$.

Let $\mathbb {Z}$ be the additive (semi)group of integers. We prove that for a finite semigroup S the direct product $\mathbb {Z}\times S$ contains only countably many subdirect products (up to isomorphism) if and only if S is regular. As a corollary we show that $\mathbb {Z}\times S$ has only countably many subsemigroups (up to isomorphism) if and only if S is completely regular.

We study analogues of Kronecker coefficients for symmetric inverse semigroups, for dual symmetric inverse semigroups and for the inverse semigroups of bijections between subquotients of finite sets. In all cases, we reduce the problem of determination of such coefficients to some group-theoretic and combinatorial problems. For symmetric inverse semigroups, we provide an explicit formula in terms of the classical Kronecker and Littlewood–Richardson coefficients for symmetric groups.

Let M be a Puiseux monoid, that is, a monoid consisting of nonnegative rationals (under standard addition). In this paper, we study factorisations in atomic Puiseux monoids through the lens of their associated Betti graphs. The Betti graph of $b \in M$ is the graph whose vertices are the factorisations of b with edges between factorisations that share at least one atom. If the Betti graph associated to b is disconnected, then we call b a Betti element of M. We explicitly compute the set of Betti elements for a large class of Puiseux monoids (the atomisations of certain infinite sequences of rationals). The process of atomisation is quite useful in studying the arithmetic of Puiseux monoids, and it has been actively considered in recent literature. This leads to an argument that for every positive integer n, there exists an atomic Puiseux monoid with exactly n Betti elements.

A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. We show that the 6-element Brandt monoid generates a finitely universal variety of monoids and, by the previous results, it is the smallest generator for a monoid variety with this property. It is also deduced that the join of two Cross varieties of monoids can be finitely universal. In particular, we exhibit a finitely universal variety of monoids with uncountably many subvarieties which is the join of two Cross varieties of monoids whose lattices of subvarieties are the 6-element and the 7-element chains, respectively.

We propose generating functions, $\textrm {RGF}_p(x)$, for the quotients of numerical semigroups which are related to the Sylvester denumerant. Using MacMahon’s partition analysis, we can obtain $\textrm {RGF}_p(x)$ by extracting the constant term of a rational function. We use $\textrm {RGF}_p(x)$ to give a system of generators for the quotient of the numerical semigroup $\langle a_1,a_2,a_3\rangle $ by p for a small positive integer p, and we characterise the generators of ${\langle A\rangle }/{p}$ for a general numerical semigroup A and any positive integer p.

A set of complex numbers $S$ is called invariant if it is closed under addition and multiplication, namely, for any $x, y \in S$ we have $x+y \in S$ and $xy \in S$. For each $s \in {\mathbb {C}}$ the smallest invariant set ${\mathbb {N}}[s]$ containing $s$ consists of all possible sums $\sum _{i \in I} a_i s^i$, where $I$ runs over all finite nonempty subsets of the set of positive integers ${\mathbb {N}}$ and $a_i \in {\mathbb {N}}$ for each $i \in I$. In this paper, we prove that for $s \in {\mathbb {C}}$ the set ${\mathbb {N}}[s]$ is everywhere dense in ${\mathbb {C}}$ if and only if $s \notin {\mathbb {R}}$ and $s$ is not a quadratic algebraic integer. More precisely, we show that if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is a transcendental number, then there is a positive integer $n$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for either $t=s$ or $t=s+s^2$. Similarly, if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is an algebraic number of degree $d \ne 2, 4$, then there are positive integers $n, m$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for $t=ms+s^2$. For quadratic and some special quartic algebraic numbers $s$ it is shown that a similar sumset of three sets cannot be dense. In each of these two cases the density of ${\mathbb {N}}[s]$ in ${\mathbb {C}}$ is established by a different method: for those special quartic numbers, it is possible to take a sumset of four sets.

Brazil et al. [‘Maximal subgroups of infinite symmetric groups’, Proc. Lond. Math. Soc. (3) 68(1) (1994), 77–111] provided a new family of maximal subgroups of the symmetric group $G(X)$ defined on an infinite set X. It is easy to see that, in this case, $G(X)$ contains subsemigroups that are not groups, but nothing is known about nongroup maximal subsemigroups of $G(X)$. We provide infinitely many examples of such semigroups.

A notion of normal submonoid of a monoid M is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf {NorSub}(M)$ of normal submonoids of M is a complete lattice. Joins are explicitly described and the lattice is computed for the finite full transformation monoids $T_n$, $n\geq ~1$. It is also shown that $\mathsf {NorSub}(M)$ is modular for a specific family of commutative monoids, including all Krull monoids, and that it, as a join semilattice, embeds isomorphically onto a join subsemilattice of the lattice $\mathsf {Cong}(M)$ of congruences on M. This leads to a new strategy for computing $\mathsf {Cong}(M)$ consisting of computing $\mathsf {NorSub}(M)$ and the so-called unital congruences on the quotients of M modulo its normal submonoids. This provides a new perspective on Malcev’s computation of the congruences on $T_n$.

The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^{*}$-algebras for inverse semigroups satisfying this condition that have a Hausdorff universal groupoid, or more generally for direct limits of inverse semigroups satisfying this condition and having Hausdorff universal groupoids. It is not difficult to see that a finitely presented inverse semigroup with a non-Hausdorff universal groupoid cannot be a direct limit of inverse semigroups with Hausdorff universal groupoids. We construct here countably many nonisomorphic finitely presented inverse semigroups with finitely many idempotents in each $\mathcal D$-class and non-Hausdorff universal groupoids. At this time, there is not a clear $C^{*}$-algebraic technique to prove these inverse semigroups have stably finite complex algebras.

We investigate the groups of units of one-relator and special inverse monoids. These are inverse monoids which are defined by presentations, where all the defining relations are of the form $r=1$. We develop new approaches for finding presentations for the group of units of a special inverse monoid, and apply these methods to give conditions under which the group admits a presentation with the same number of defining relations as the monoid. In particular, our results give sufficient conditions for the group of units of a one-relator inverse monoid to be a one-relator group. When these conditions are satisfied, these results give inverse semigroup theoretic analogues of classical results of Adjan for one-relator monoids, and Makanin for special monoids. In contrast, we show that in general these classical results do not hold for one-relator and special inverse monoids. In particular, we show that there exists a one-relator special inverse monoid whose group of units is not a one-relator group (with respect to any generating set), and we show that there exists a finitely presented special inverse monoid whose group of units is not finitely presented.