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.

The endomorphism monoid of a model-theoretic structure carries two interesting topologies: on the one hand, the topology of pointwise convergence induced externally by the action of the endomorphisms on the domain via evaluation; on the other hand, the Zariski topology induced within the monoid by (non-)solutions to equations. For all concrete endomorphism monoids of $\omega $-categorical structures on which the Zariski topology has been analysed thus far, the two topologies were shown to coincide, in turn yielding that the pointwise topology is the coarsest Hausdorff semigroup topology on those endomorphism monoids.

We establish two systematic reasons for the two topologies to agree, formulated in terms of the model-complete core of the structure. Further, we give an example of an $\omega $-categorical structure on whose endomorphism monoid the topology of pointwise convergence and the Zariski topology differ, answering a question of Elliott, Jonušas, Mitchell, Péresse, and Pinsker.

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for certain one-relator monoids, and inverse monoids, can be reduced to solving the membership problem in prefix monoids of certain one-relator groups. Motivated by this, in this paper, we study the class of prefix monoids of finitely presented groups. We obtain a complete description of this class of monoids. All monoids in this family are finitely generated, recursively presented and group-embeddable. Our results show that not every finitely generated recursively presented group-embeddable monoid is a prefix monoid, but for every such monoid, if we take a free product with a suitably chosen free monoid of finite rank, then we do obtain a prefix monoid. Conversely, we prove that every prefix monoid arises in this way. Also, we show that the groups that arise as groups of units of prefix monoids are precisely the finitely generated recursively presented groups, whereas the groups that arise as Schützenberger groups of prefix monoids are exactly the recursively enumerable subgroups of finitely presented groups. We obtain an analogous result classifying the Schützenberger groups of monoids of right units of special inverse monoids. We also give some examples of right cancellative monoids arising as monoids of right units of finitely presented special inverse monoids, and we show that not all right cancellative recursively presented monoids belong to this class.

An example of a nonfinitely based involution monoid of order five has recently been discovered. We confirm that this example is, up to isomorphism, the unique smallest among all involution monoids.

We propose a notion of a proper Ehresmann semigroup based on a three-coordinate description of its generating elements governed by certain labelled directed graphs with additional structure. The generating elements are determined by their domain projection, range projection and σ-class, where σ denotes the minimum congruence that identifies all projections. We prove a structure result on proper Ehresmann semigroups and show that every Ehresmann semigroup has a proper cover. Our covering monoid turns out to be isomorphic to that from the work by Branco, Gomes and Gould and provides a new view of the latter. Proper Ehresmann semigroups all of whose elements admit a three-coordinate description are characterized in terms of partial multiactions of monoids on semilattices. As a consequence, we recover the two-coordinate structure result on proper restriction semigroups.

We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli–Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular fibres over the maximal equicontinuous factor. The ideas are illustrated using the class of substitution shifts. A body of elaborate examples shows that the assumptions of our results cannot be relaxed.

This paper studies the structure and preservational properties of lower bounded HNN extensions of inverse semigroups, as introduced by Jajcayová. We show that if $S^* = [ S;\; U_1,U_2;\; \phi ]$ is a lower bounded HNN extension then the maximal subgroups of $S^*$ may be described using Bass-Serre theory, as the fundamental groups of certain graphs of groups defined from the $\mathcal{D}$-classes of $S$, $U_1$ and $U_2$. We then obtain a number of results concerning when inverse semigroup properties are preserved under the HNN extension construction. The properties considered are completely semisimpleness, having finite $\mathcal{R}$-classes, residual finiteness, being $E$-unitary, and $0$-$E$-unitary. Examples are given, such as an HNN extension of a polycylic inverse monoid.

We call a semigroup right perfect if every object in the category of unitary right acts over that semigroup has a projective cover. In this paper, we generalize results about right perfect monoids to the case of semigroups. In our main theorem, we will give nine conditions equivalent to right perfectness of a factorizable semigroup. We also prove that right perfectness is a Morita invariant for factorizable semigroups.

In a 1968 issue of the Proceedings, P. M. Cohn famously claimed that a commutative domain is atomic if and only if it satisfies the ascending chain condition on principal ideals (ACCP). Some years later, a counterexample was however provided by A. Grams, who showed that every commutative domain with the ACCP is atomic, but not vice versa. This has led to the problem of finding a sensible (ideal-theoretic) characterisation of atomicity.

The question (explicitly stated on p. 3 of A. Geroldinger and F. Halter–Koch’s 2006 monograph on factorisation) is still open. We settle it here by using the language of monoids and preorders.