Related papers: Separability conditions in acts over monoids

Recently Alonso and Hermiller introduced a homological finiteness condition\break $bi{-}FP_n$ (here called {\it weak} $bi{-}FP_n$) for monoid rings, and Kobayashi and Otto introduced a different property, also called $bi{-}FP_n$ (we adhere…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Using first and second order supersymmetry formalism we obtain a class of exactly solvable potentials subject to moving boundary conditions.

Recently two different concepts of covers of acts over monoids have been studied. That based on coessential epimorphisms and that based on Enochs' definition of a flat cover of a module over a ring. Two recent papers have suggested that in…

Given a monoid defined by a presentation, and a homotopy base for the derivation graph associated to the presentation, and given an arbitrary subgroup of the monoid, we give a homotopy base (and presentation) for the subgroup. If the monoid…

With every reduced $E$-Fountain semigroup $S$ which satisfies the generalized right ample condition we associate a category with zero morphisms $\mathcal{C}(S)$. Under some assumptions we prove an isomorphism of $\Bbbk$-algebras $\Bbbk…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

Let G be the free product of groups A and B with commuting subgroups H \leqslant A and K \leqslant B, and let C be the class of all finite groups or the class of all finite p-groups. We derive the description of all C-separable cyclic…

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any…

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

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…

We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…

First, we prove a theorem on dynamics of actions of monoids by endomorphisms of semigroups. Second, we introduce algebraic structures suitable for formalizing infinitary Ramsey statements and prove a theorem that such statements are implied…

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

We show that every isometric action on a Cantor set is conjugate to an inverse limit of actions on finite sets; and that every isometric action by a finitely generated amenable group is residually finite.

Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…

We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid $F$. It is also decidable whether or not a rational subset of $F$ is recognizable. We prove that a submonoid of $F$ is rational if and…