Totally Ordered Commutative Monoids

Petri nets with generalized algebra: a comparison

On a Class of Lattice Ordered Inverse Semigroups

Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoid are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. An O(n log(n)) algorithm on a RAM for the word problem is presented, and NP-completeness of the generalized word problem and the membership problem for rational sets is shown. Moreover, free partially commutative inverse monoids modulo a finite idempotent presentation are studied. For these monoids, the word problem is decidable if and only if the complement of the commutation relation is transitive.KeywordsWord ProblemInverse SemigroupCayley GraphDependence GraphDependence RelationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

For any commutative semigroup S and positive integer m the power function f: S rightarrow S defined by f(x) = x^m is an endomorphism of S. We partly solve the Lesokhin–Oman problem of characterizing the commutative semigroups whose all endomorphisms are power functions. Namely, we prove that every endomorphism of a commutative monoid S is a power function if and only if S is a finite cyclic group, and that every endomorphism of a commutative ACCP-semigroup S with an idempotent is a power function if and only if S is a finite cyclic semigroup. Furthermore, we prove that every endomorphism of a nontrivial commutative atomic monoid S with 0, preserving 0 and 1, is a power function if and only if either S is a finite cyclic group with zero adjoined or S is a cyclic nilsemigroup with identity adjoined. We also prove that every endomorphism of a 2-generated commutative semigroup S without idempotents is a power function if and only if S is a subsemigroup of the infinite cyclic semigroup.

Set Constraints in Some Equational Theories

On regular trace languages

Trace monoids are obtained from free monoids by defining a subset I of pairs of letters that are allowed to commute. Most of the work of this theory is an attempt to relate the properties of these monoids to the properties of I. Following the work initiated by Buchi we show that when I is an equivalence relation (the trace monoid is then a free product of free commutative monoids) it is possible to define a second order logic whose models are the traces viewed as dependence graphs and which characterizes exactly the sets of traces that are rational. This logic essentially utilizes a predicate based on the ordering defined by the dependence graph and a predicate related to a restricted use of the comparison of cardinality.

The word problem for inverse monoids generated by a set $Gamma$ subject to relations of the form $e=f$, where $e$ and $f$ are both idempotents in the free inverse monoid generated by $Gamma$, is investigated. It is shown that for every fixed monoid of this form the word problem can be solved in polynomial time which solves an open problem of Margolis and Meakin. For the uniform word problem, where the presentation is part of the input, EXPTIME-completeness is shown. For the Cayley-graphs of these monoids, it is shown that the first-order theory with regular path predicates is decidable. Regular path predicates allow to state that there is a path from a node $x$ to a node $y$ that is labeled with a word from some regular language. As a corollary, the decidability of the generalized word problem is deduced. Finally, some results on free partially commutative inverse monoids are presented.

In this paper we have studied the concept of Anti fuzzy ideals in Left Almost Semigroups (LA-semigroup in short). The equivalent statement for an LA-semigroup to be a commutative semigroup is proved. The set of all anti fuzzy left ideals, which are idempotents, forms a commutative monoid. Moreover it has been shown that the union of any family of Anti fuzzy left ideals of an LA-semigroup is an anti fuzzy left ideal of F(S). The relation of anti fuzzy left(right) ideals, anti fuzzy interior ideals and anti fuzzy bi-ideals in LA-semigroups has been studied. Anti fuzzy points have been defined in an LA-semigroup and has been shown the representation of largest fuzzy left ideal generated by a fuzzy point.

Noetherian Semigroup Rings with Several Objects

Let S be a cancellative monoid with quotient group of torsion-free rank a.We show that the monoid ring R[S] is a Hilbert ring if and only if the polynomial ring R[{ X, },s/] is a Hilbert ring, where |/| = a.Assume that R is a commutative unitary ring and G is an abelian group.The first research problem listed in [K, Chapter 7] is that of determining equivalent conditions in order that the group ring R[G] should be a Hilbert ring.Matsuda has considered this question in [Ml, 6].His results show that for G finitely generated, R[G] and R are simultaneously Hilbert rings; if G is not finitely generated, then R[G] a Hilbert ring implies that R is a Hilbert ring, but the converse fails.In [M2, 5] Matsuda considers briefly the corresponding Hilbert-ring-characterization problem for a monoid ring R[S], where S is torsion-free and cancellative.Let a be the torsion-free rank of G and let {Xj)lsl be a set of indeterminates over R of cardinality a.In Corollary 1 we show that R[G] and P[{^,},e/] are simultaneously Hilbert rings.While the problem of determining equivalent conditions for P[{Ar,}/e/] to be a Hilbert ring has not been completely resolved, it has been worked on extensively [Kr, Go, L, Gl, H], and a significant body of positive results exists concerning this problem.The proof of Theorem 1 suggests the following conjecture: if S is a cancellative commutative monoid with quotient group G, then R[S] is a Hilbert ring if and only if R[G] is a Hilbert ring; this result is established in Theorem 2.All monoids considered are assumed to be commutative, and rings are assumed to be commutative and unitary.The statement of Theorem 1 uses the following terminology.For a cardinal number a, an extension ring T of R is said to be a-generated over R if T is generated over R by a set of cardinality at most a.Theorem 1. Assume that X = {XA is a set of indeterminates of cardinality a over the ring R. Denote by Za the direct sum of a copies of the additive group Z of integers.The following conditions are equivalent.(1) R[X] is not a Hilbert ring.(2) There exists a prime ideal P of R such that R/P admits an a-generated extension ring that is a G-domain, but not afield.(3) The group ring R[Za] is not a Hilbert ring._

We compare two notions of coding on traces, called coding and strong coding, in relation with the decision problem of the existence of a coding between two given trace monoids. We positively solve this problem if the first monoid is either a direct product of free monoids, or a free product of free commutative monoids. We show how the situation differs in the case of strong codings.

This paper presents an approach to integrate the m-machine production scheduling into Material Requirements Planning (MRP). In general, generating MRP considers only Bill of Materials (BOM) and ignores capacity constraints and operating sequences; therefore, a production plan is unachievable when scheduling is actually performed next on shop-floor. That is why recent research has focused on executing both MRP and scheduling simultaneously. Our approach uses an integer linear programming model to plan and schedule concurrently to look right through the capacity constraints and operating sequences. The objective function of the proposed model considers both planning and scheduling purposes that is to minimize total inventory costs and order's tardiness. All significant and inevitable concerns when separately generating MRP and schedule are incorporated with the model through several constraints. Numerical results show that this model can be used to simultaneously generate reasonable MRP as well as feasible and optimal m-machine production schedule.

The study of flat ring morphisms is an important theme in commutative algebra. The purpose of this article is to develop an abstract theory of flatness in the framework of coherent quantales. The first question we must address is the definition of a notion of “flat quantale morphism” as an abstraction of flat ring morphisms. For this, we start from a characterization of the flat ring morphism in terms of the ideal residuation theory. The flat coherent quantale morphism is studied in relation to the localization of coherent quantales. The quantale generalizations of some classical theorems from the flat ring morphisms theory are proved. The Going-down and Going-up properties are then studied in connection with localization theory and flat quantale morphisms. As an application, characterizations of zero-dimensional coherent quantales are obtained, formulated in terms of Going-down, Going-up, and localization. We also prove two characterization theorems for the coherent quantales of dimension at most one. The results of the paper can be applied both in the theory of commutative rings and to other algebraic structures: F-rings, semirings, bounded distributive lattices, commutative monoids, etc.

Commutative rings and zero-divisor semigroups of regular polyhedrons