Related papers: Separability conditions in acts over monoids
We investigate four finiteness conditions related to residual finiteness: complete separability, strong subsemigroup separability, weak subsemigroup separability and monogenic subsemigroup separability. For each of these properties we…
Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard…
The main purpose of this paper is investigating classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of…
This article examines the three-way relationship between right coherency of a monoid $S$, solutions of equations over $S$-acts, and injectivity properties of $S$-acts. A monoid $S$ is right coherent if every finitely generated subact of…
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
The paper is devoted to the investigation of uniform notion for acts over semigroups perceived as an overclass of subdirectly irreducible acts. We establish conditions to fill the gap between these classes of acts. Besides we prove that…
We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…
We study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. The maximality of the growth implies some other specific properties of these acts…
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…
It is proved that all finitely generated subgroups of generalized free product of two groups are finitely separable provided that free factors have this property and amalgamated subgroups are normal in corresponding factors and satisfy the…
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
The themes of cancellation, internal cancellation, substitution have led to a lot of interesting research in the theory of modules over commutative and noncommutative rings. In this paper, we introduce and study cancellation problem in the…
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…
Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a…