Related papers: Strongly nonfinitely based monoids

We consider monoids equipped with a compatible quantale valued relation, to which we call quantale enriched monoids, and study semidirect products of such structures. It is well-known that semidirect products of monoids are closely related…

There are several families of atomic monoids whose arithmetical invariants have received a great deal of attention during the last two decades. The factorization theory of finitely generated monoids, strongly primary monoids, Krull monoids,…

We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.

Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…

We prove that the quasivariety of groups generated by finite and locally indicable groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses…

We show that if a subsemigroup $S$ of the bicyclic monoid ${\mathscr{C}}(p,q)$ contains infinitely many idempotents then $S$ admits only the discrete Hausdorff shift-continuous topology. Also we proof that every right-continuous…

We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

We study monoids generated by various combinations of idempotents and one- or two-sided units of an infinite partial Brauer monoid. This yields a total of eight such monoids, each with a natural characterisation in terms of relationships…

In this paper, we consider the monoid $\mathcal{PIO}_{n}$, of all partial order-preserving transformations on a chain with $n$ elements whose domains and ranges are intervals, along with its submonoid $\mathcal{PIO}_{n}^-$ of…

A finite semifield $D$ is a finite nonassociative ring with identity such that the set $D^*=D\setminus\{0\}$ is closed under the product. In this paper we obtain a computer-assisted description of all 64-element finite semifields, which…

It is proven that an infinite finitely generated group cannot be elementarily equivalent to an ultraproduct of finite groups of a given Pr\"ufer rank. Furthermore, it is shown that an infinite finitely generated group of finite Pr\"ufer…

We show that the fundamental group is not invariant under derived equivalence of smooth projective varieties.

In this paper, we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph…

The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…

We establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. Applying this condition, we prove that the six-element additively idempotent semiring $SR_6$ has no finite basis for its identity.…

This paper presents new results on the identities satisfied by the sylvester and Baxter monoids. We show how to embed these monoids, of any rank strictly greater than 2, into a direct product of copies of the corresponding monoid of rank 2.…

We show that the $f$-vector sets of $d$-polytopes have non-trivial additive structure: They span affine lattices and are embedded in monoids that we describe explicitly. Moreover, for many large subclasses, such as the simple polytopes, or…

If a finitely generated monoid M is defined by a finite number of degree-preserving relations, then it has linear growth if and only if it can be decomposed into a finite disjoint union of subsets (which we call "sandwiches") of the form…