On Automatic Rees Matrix Semigroups

We consider a Rees matrix semigroup S = M[U; I, J; P] over a semigroup U, with I and J finite index sets, and relate the automaticity of S with the automaticity of U. We prove that if U is an automatic semigroup and S is finitely generated then S is an automatic semigroup. If S is an automatic semigroup and there is an entry p in the matrix P such that pU ¹ = U then U is automatic. We also prove that if S is a prefix-automatic semigroup, then U is a prefix-automatic semigroup.     

Archimedean ordered semigroups as ideal extensions

The main result of the paper is a structure theorem concerning the ideal extensions of archimedean ordered semigroups. We prove that an archimedean ordered semigroup which contains an idempotent is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup. Conversely, if an ordered semigroup S is an ideal extension of a simple ordered semigroup by a nil ordered semigroup, then S is archimedean. As a consequence, an ordered semigroup is archimedean and contains an idempotent if and only if it is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup.     

The Oversemigroups of a Numerical Semigroup

Abstract. We study the set of numerical semigroups containing a given numerical semigroup. As an application we prove characterizations of irreducible numerical semigroups that unify some of the existing characterizations for symmetric and pseudo-symmetric numerical semigroups. Finally we describe an algorithm for computing a minimal decomposition of a numerical semigroup in terms of irreducible numerical semigroups.     

On left regular and intra-regular ordered semigroups

We study the decomposition of left regular ordered semigroups into left regular components and the decomposition of intra-regular ordered semigroups into simple or intra-regular components, adding some additional information to the results considered in [KEHAYOPULU, N.: On left regular ordered semigroups, Math. Japon. 35 (1990), 1057–1060] and [KEHAYOPULU, N.: On intra-regular ordered semigroups, Semigroup Forum 46 (1993), 271–278]. We prove that an ordered semigroup S is left regular if and only if it is a semilattice (or a complete semilattice) of left regular semigroups, equivalently, it is a union of left regular subsemigroups of S. Moreover, S is left regular if and only if it is a union of pairwise disjoint left regular subsemigroups of S. The right analog also holds. The same result is true if we replace the words “left regular” by “intraregular”. Moreover, an ordered semigroup is intra-regular if and only if it is a semilattice (or a complete semilattice) of simple semigroups. On the other hand, if an ordered semigroup is a semilattice (or a complete semilattice) of left simple semigroups, then it is left regular, but the converse statement does not hold in general. Illustrative examples are given.     

Systems of proportionally modular Diophantine inequalities

The set of integer solutions to the inequality ax mod b≤c x is a numerical semigroup. We study numerical semigroups that are intersections of these numerical semigroups. Recently it has been shown that this class of numerical semigroups coincides with the class of numerical semigroups having a Toms decomposition. The first author was (partially) supported by the Centro de Matemática da Universidade do Porto (CMUP), financed by FCT (Portugal) through the programmes POCTI and POSI, with national and European Community structural funds. The last three authors are supported by the project MTM2004-01446 and FEDER funds. The authors would like to thank the referee for her/his comments and suggestions.     

Intuitionistic fuzzy semiprime ideals in ordered semigroups

We give characterizations of different classes of ordered semigroups by using intuitionistic fuzzy ideals. We prove that an ordered semigroup is regular if and only if every intuitionistic fuzzy left (respectively, right) ideal of S is idempotent. We also prove that an ordered semigroup S is intraregular if and only if every intuitionistic fuzzy two-sided ideal of S is idempotent. We give further characterizations of regular and intra-regular ordered semigroups in terms of intuitionistic fuzzy left (respectively, right) ideals. In conclusion of this paper we prove that an ordered semigroup S is left weakly regular if and only if every intuitionistic fuzzy left ideal of S is idempotent.     

Su una condizione di finitezza per semigruppi finitamente generati

We prove that a finitely generated semigroupS is finite if and only if there exists an integern such that in each sequence ofn elements ofS there exist two different non empty factors with the same value inS. We prove this result using only elementary facts concerning the canonical form of an element of a finitely generated semigroup.     

Generators and relations for subsemigroups via boundaries in Cayley graphs

Given a finitely generated semigroup S and subsemigroup T of S, we define the notion of the boundary of T in S which, intuitively, describes the position of T inside the left and right Cayley graphs of S. We prove that if S is finitely generated and T has a finite boundary in S then T is finitely generated. We also prove that if S is finitely presented and T has a finite boundary in S then T is finitely presented. Several corollaries and examples are given.     

Bands of weakly r-Archimedean ordered semigroups

In this paper, some characterizations that an ordered semigroup S is a band of weakly r-archimedean ordered subsemigroups of S are given by some relations on S . We prove that an ordered semigroup S is a band of weakly r -archimedean ordered subsemigroups if and only if S is regular band of weakly r -archimedean ordered subsemigroups. Finally, we obtain that a negative ordered semigroup S is a band of weakly r-archimedean ordered subsemigroups of S if and only if S is a band of r-archimedean ordered subsemigroups of S . As an application the corresponding results on semigroups without order can be obtained by moderate modifications. August 27, 1999     

On semigroups admitting ring structure

A right-chain semigroup is a semigroup whose right ideals are totally ordered by set inclusion. The main result of this paper says that if S is a right-chain semigroup admitting a ring structure, then either S is a null semigroup with two elements or sS=S for some s∈S. Using this we give an elementary proof of Oman’s characterization of semigroups admitting a ring structure whose subsemigroups (containing zero) form a chain. We also apply this result, along with two other results proved in this paper, to show that no nontrivial multiplicative bounded interval semigroup on the real line ℝ admits a ring structure, obtaining the main results of Kemprasit et al. (ScienceAsia 36: 85–88, 2010).     

On Solvable R* Groups of Finite Rank

Abstract

For an element a of a group G,let S(a) denote the semigroup generated by all conjugates of a in G. We prove that if G is solvable of finite rank and 1 ? S(a) for all 1 ≠ a ∈ G,then ?a ^G ?/?b ^G ? is a periodic group for every b ∈ S(a). Conversely if every two generator subgroup of a finitely generated torsion-free solvable group G has this property then G has finite rank,and if every finitely generated subgroup has this property then every partial order on G can be extended to a total order.     

One half of a pseudo-symmetric numerical semigroup

We prove that a numerical semigroup is irreducible if and onlyif it is one half of a pseudo-symmetric numerical semigroup.As a consequence we find that every numerical semigroup canbe obtained by dividing a pseudo-symmetric numerical semigroupby 4.     

On finiteness conditions for Rees matrix semigroups

Let T=[S; I; J; P] be a Rees matrix semigroup where S is a semigroup, I and J are index sets, and P is a J × I matrix with entries from S, and let U be the ideal generated by all the entries of P. If U has finite index in S, then we prove that T is periodic (locally finite) if and only if S is periodic (locally finite). Moreover, residual finiteness and having solvable word problem are investigated.     

ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS

ABSTRACT

Heinzer, Mirbagheri, Ratliff, and Shah investigate parametric decomposition of monomial ideals on a regular sequence of a commutative ring R with identity 1 and prove that if every finite intersection of monomial ideals in R is again a monomial ideal, then each monomial ideal has a unique irredundant parametric decomposition. Sturmfels, Trung, and Vogels prove a similar result without the uniqueness. Bayer, Peeva, and Strumfels study generic monomial ideals, that is monomial ideals in the polynomial ring such that no variable appears with the same nonzero exponent in two different minimal generators, and for these ideals they prove the uniqueness of the irredundant irreducible decompositions and give an algorithm to construct this unique irredundant irreducible decomposition. In this paper, we present three algorithms for finding the unique irredundant irreducible decomposition of any monomial ideal.     

Identities of semigroup rings over semilattices of completely (0-) simple semigroups

LetR be a ring with identity,S be a semigroup with the set of idempotentsE(S), and denote (E(S)) for the subsemigroup ofS generated byE(S). In this paper, we prove that ifS is a semilattice of completely 0-simple semigroups and completely simple semigroups, then the semigroup ringRS possesses an identity iff so doesR(E(S)); especially, the result is true forS being a completely regular semigroup.     

The oversemigroups of a numerical semigroup

We study the set of numerical semigroups containing a given numerical semigroup. As an application we prove characterizations of irreducible numerical semigroups that unify some of the existing characterizations for symmetric and pseudo-symmetric numerical semigroups. Finally we describe an algorithm for computing a minimal decomposition of a numerical semigroup in terms of irreducible numerical semigroups.     

Embedding Semigroups into Idempotent Generated Ones

We present a concrete model of the embedding due to Pastijn and Yan of a semigroup S into an idempotent generated semigroup now in terms of a Rees matrix semigroup over S¹. The paper starts with a comparison of the two embeddings. Studying the properties of this embedding, we prove that it is functorial. We show that a number of usual semigroup properties is preserved by this embedding, such as periodicity, finiteness, the cryptic property, regularity, complete semisimplicity and various local properties, but complete regularity is not one of them.     

Embedding Semigroups into Idempotent Generated Ones

We present a concrete model of the embedding due to Pastijn and Yan of a semigroup S into an idempotent generated semigroup now in terms of a Rees matrix semigroup over S¹. The paper starts with a comparison of the two embeddings. Studying the properties of this embedding, we prove that it is functorial. We show that a number of usual semigroup properties is preserved by this embedding, such as periodicity, finiteness, the cryptic property, regularity, complete semisimplicity and various local properties, but complete regularity is not one of them.     

Howson's Property for Semidirect Products of Semilattices by Groups

An inverse semigroup S is a Howson inverse semigroup if the intersection of finitely generated inverse subsemigroups of S is finitely generated. Given a locally finite action θ of a group G on a semilattice E, it is proved that E*_θG is a Howson inverse semigroup if and only if G is a Howson group. It is also shown that this equivalence fails for arbitrary actions.     

ON ORDERED COMPLETELY SIMPLE SEMIGROUPS

We consider an ordered completely simple semigroup S = M(G; I, Λ; P) which is non-degenerate in the sense that G, I, Λ are non-trivial. We prove that if every element of S has a biggest inverse then S contains at least one of seven particular types of subsemigroup.