On the set of elasticities in numerical monoids

In an atomic, cancellative, commutative monoid S, the elasticity of an element provides a coarse measure of its non-unique factorizations by comparing the largest and smallest values in its set of factorization lengths (called its length set). In this paper, we show that the set of length sets \({\mathcal {L}}(S)\) for any arithmetical numerical monoid S can be completely recovered from its set of elasticities R(S); therefore, R(S) is as strong a factorization invariant as \({\mathcal {L}}(S)\) in this setting. For general numerical monoids, we describe the set of elasticities as a specific collection of monotone increasing sequences with a common limit point of \(\max R(S)\).     

On the linearity of ω-primality in numerical monoids

In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.     

Structure of a finite commutative inverse semigroup and a finite bundle for which the inverse monoid of local automorphisms is permutable

For a semigroup S, the set of all isomorphisms between the subsemigroups of the semigroup S with respect to composition is an inverse monoid denoted by PA(S) and called the monoid of local automorphisms of the semigroup S. The semigroup S is called permutable if, for any couple of congruences ρ and σ on S, we have ρ ∘ σ = σ ∘ ρ. We describe the structures of a finite commutative inverse semigroup and a finite bundle whose monoids of local automorphisms are permutable.     

On finitely presented,cancellative and commutative ordered monoids

We show that every finitely presented, cancellative and commutative ordered monoid is determined by a finitely generated and cancellative pseudoorder on the monoid (ℕ ⁿ ,+) for some positive integer n. Every cancellative pseudoorder on (ℕ ⁿ ,+) is determined by a submonoid of the group (ℤ ⁿ ,+), and we prove that the pseudoorder is finitely generated if and only if the submonoid is an affine monoid in ℤ ⁿ .     

Retracts and monomorphism monoids in semigroup varieties

If a semigroup varietyV contains the variety of commutative three-nilpotent semigroups, or if it is a variety of bands containing all semilattices, then, for anyA∈V and any left cancellative monoidM, there is a semigroupS∈V such thatA is a retract ofS andM is isomorphic to the monoid of all injective endomorphisms ofS.     

A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative

In this paper we give an algorithm to compute a finite presentation for any finitely generated commutative cancellative monoid, and in particular we apply it to derive an algorithm to decide whether a finitely presented commutative monoid is cancellative or not.     

On t-closedness of generalized power series rings

For an extension A⊆B of commutative rings, we present a sufficient condition for the ring [[A^S,?]] of generalized power series to be t-closed in [[B^S,?]], where (S,?) is a torsion-free cancellative ordered monoid. As a corollary, this result can be applied to the ring of power series in any number of indeterminates.     

Ordered semigroups which are both right commutative and right cancellative

In this paper we prove that each right commutative, right cancellative ordered semigroup (S,.,??) can be embedded into a right cancellative ordered semigroup (T,??,?) such that (T,??) is left simple and right commutative. As a consequence, an ordered semigroup S which is both right commutative and right cancellative is embedded into an ordered semigroup T which is union of pairwise disjoint abelian groups, indexed by a left zero subsemigroup of?T.     

Principal Weak Flatness and Regularity of Diagonal Acts

For a monoid S, the set S × S equipped with the componentwise right S-action is called the diagonal act of S and is denoted by D(S). A monoid S is a left PP (left PSF) monoid if every principal left ideal of S is projective (strongly flat). We shall call a monoid S left P(P) if all principal left ideals of S satisfy condition (P). We shall call a monoid S weakly left P(P) monoid if the equalities as = bs, xb = yb in S imply the existence of r ∈ S such that xar = yar, rs = s. In this article, we prove that a monoid S is left PSF if and only if S is (weakly) left P(P) and D(S) is principally weakly flat. We provide examples showing that the implications left PSF ? left P(P) ? weakly left P(P) are strict. Finally, we investigate regularity of diagonal acts D(S), and we prove that for a right PP monoid S the diagonal act D(S) is regular if and only if every finite product of regular acts is regular. Furthermore, we prove that for a full transformation monoid S = 𝒯 _X , D(S) is regular.     

Commutative cancellative semigroups of finite rank

The rank of a commutative cancellative semigroup S is the cardinality of a maximal independent subset of S. Commutative cancellative semigroups of finite rank are subarchimedean and thus admit a Tamura-like representation. We characterize these semigroups in several ways and provide structure theorems in terms of a construction akin to the one devised by T. Tamura for N-semigroups.     

Diversity in monoids

Let M be a (commutative cancellative) monoid. A nonunit element q ∈ M is called almost primary if for all a, b ∈ M, q | ab implies that there exists k ∈ ? such that q | a ^k or q | b ^k . We introduce a new monoid invariant, diversity, which generalizes this almost primary property. This invariant is developed and contextualized with other monoid invariants. It naturally leads to two additional properties (homogeneity and strong homogeneity) that measure how far an almost primary element is from being primary. Finally, as an application the authors consider factorizations into almost primary elements, which generalizes the established notion of factorization into primary elements.     

Quotient monoids and greatest commutative monoid images of several types

The concept of a quotient monoid modulo a subtractive subsemigroup is exploited systematically to determine necessary and sufficient conditions for a commutative semigroup to possess greatest monoid images that are separative, cancellative, power cancellative, or totally cancellative. The group of units of each such greatest image is determined and the images themselves are described via quotient monoids.     

On graphs with a given endomorphism monoid

Hedrlín and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M . In this paper we give a construction G(M) for a graph with prescribed endomorphism monoid M . Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids. For example we show that for every monoid M , | M |=m there is a graph G with End(G)? M and |E(G)|≤(1 + 0(1))m². This is, up to a factor of 1/2, best possible since there are monoids requiring a graph with \begin{eqnarray*} && \frac{m^{2}}{2}(1 -0(1)) \end{eqnarray*} edges. We state bounds for the class of all monoids as well as for certain subclasses—groups, k‐cancellative monoids, commutative 3‐nilpotent monoids, rectangular groups and completely simple monoids. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 241–262, 2009     

Graphs and ranks of monoids

For a finite monoid S, let ν(S) (ν_d(S)) denote the least number n such that there exists a graph (directed graph) Γ of order n with End(Γ)?S. Also let rank(S) be the smallest number of elements required to generate S. In this paper, we use Cayley digraphs of monoids, to connect lower bounds of ν(S) (ν_d(S)) to the lower bounds of rank(S). On the other hand, we connect upper bounds of rank(S) to upper bounds of ν(S) (ν_d(S)).     

The inflation class operator

We consider the inflation class operator, denoted by F, where for any class K of algebras, F(K) is the class of all inflations of algebras in K. We study the interaction of this operator with the usual algebraic operators H, S andP, and describe the partially-ordered monoid generated by H, S, P andF (with the isomorphism operator I as an identity). Received February 3, 2004; accepted in final form January 3, 2006.     

Integral Closure of Graded Integral Domains

Let Γ be a torsion-free cancellative commutative monoid and let R = ?_α∈ΓR_α be a commutative Γ-graded ring. We show that if R is a graded Noetherian domain, then its integral closure is a graded Krull domain. This is a graded analog of the Mori–Nagata theorem. We also show that for a graded Strong Mori domain, its complete integral closure is a graded Krull domain but its integral closure is not necessarily a graded Krull domain.     

The Extraction Degree of Cale Monoids

The extraction degree measures commonality of factorization between any two elements in a commutative, cancellative monoid. Additional properties of the extraction degree are developed for monoids possessing a Cale basis. For block monoids, the complete set of extraction degrees is calculated between any two elements, between any two irreducible elements, and between any irreducible element and any general element.     

On morphisms of commutative monoids

The aim of this work is to study monoid morphisms between commutative monoids. Algorithms to check if a monoid morphism between two finitely generated monoids is injective and/or surjective are given. The structure of the set of monoid morphisms between a monoid and a cancellative monoid is also studied and an algorithm to obtain a system of generators of this set is provided.     

A partial converse to a theorem of Tamari

Let M be a cancellative monoid such that the monoid ring ℤM has no zero divisors. We show that if the monoid consisting of all elements of ℤM with strictly positive coefficients has nonzero common right multiples, then M is left amenable.