On the Ranks of Certain Semigroups of Orientation Preserving Transformations

We classify the unmixed squarefree lexsegment ideals and determine those which are Cohen–Macaulay.     

On Finite Semigroups Embeddable in Inverse Semigroups

No Abstract. October 29, 1998     

On Idempotent Ranks of Semigroups of Partial Transformations

A subset U of a semigroup S is a generating set for S if every element of S may be written as a finite product of elements of U. The rank of S is the size of a minimal generating set of S, and the idempotent rank of S is the size of a minimal generating set of S consisting of idempotents in S. A partition of a q-element subset of the set X_n={1,2,..., n} is said to be of type if the sizes of its classes form the partition of q n. A non-trivial partition of a positive integer q consists of k < q elements. For a non-trivial partition of q n, the semigroup S(), generated by all the transformations with kernels of type , is idempotent-generated. It is known that if is a non-trivial partition of n, that is, S() consists of total many-to-one transformations, then the rank and the idempotent rank of S() are both equal to max{ⁿ_d, N()}, where N() is the number of partitions of X_n of type . We extend this result to semigroups of partial transformations, and prove that if is a non-trivial partition of q < n, then the rank and the idempotent rank of S() are both equal to N().     

On Functions Commuting with Semigroups of Transformations of Algebras

Siberian Mathematical Journal -     

Derived Rees Matrix Semigroups as Semigroups of Transformations

An ordered pair (e,f) of idempotents of a regular semigroup is called a skew pair if ef is not idempotent whereas fe is idempotent. Previously [1] we have established that there are four distinct types of skew pairs of idempotents. We have also described (as quotient semigroups of certain regular Rees matrix semigroups [2]) the structure of the smallest regular semigroups that contain precisely one skew pair of each of the four types, there being to within isomorphism ten such semigroups. These we call the derived Rees matrix semigroups. In the particular case of full transformation semigroups we proved in [3] that T_X contains all four skew pairs of idempotents if and only if |X| ≥ 6. Here we prove that T_X contains all ten derived Rees matrix semigroups if and only if |X| ≥ 7.     

C~*-代数的Cuntz半群(英文)

令A是一个C~*-代数.设(x,y)是A的Cuntz半群W(A)中的一个元素对.本文在适当的条件下具体刻画了所有的(x,y),使其满足性质:如果x≤y,那么存在z∈W(A)使得x+z=y.另外,本文还讨论了交换C~*-代数关于Cuntz比较的一些性质.     

Factorisable Semigroups of Generalized Transformations

ABSTRACT

If X and Y are sets, we let P(X, Y ) denote the set of all partial transformations from X into Y (that is, all mappings whose domain and range are subsets of X and Y, respectively). We define an operation * on P(X, Y ) by choosing θ ∈ P(Y, X) and writing: α*β = α °θ°β, for each α, β ∈ P(X, Y ). Then (P(X, Y ), *) is a semigroup, and some authors have determined when this is regular (Magill and Subbiah, 1975 Magill , K. D. , Jr. Subbiah , S. ( 1975 ). Green's relations for regular elements of sandwich semigroups. I. General results . Proc. London Math. Soc. 31 : 194 – 210 . [CSA] [Crossref], [Web of Science ®] , [Google Scholar]), when it contains a “proper dense subsemigroup” (Wasanawichit and Kemprasit, 2002 Wasanawichit , A. , Kemprasit , Y. ( 2002 ). Dense subsemigroups of generalized transformation semigroups . J. Austral. Math. Soc. 73 ( 3 ): 433 – 445 . [CSA] [Crossref] , [Google Scholar]) and when it is factorisable (Saengsura, 2001 Saengsura , K. ( 2001 ). Factorizable on (P(X, Y ), θ) , MSc thesis, 23 pp (in Thai, with English summary), Department of Mathematics, Khon Kaen University, Khon Kaen, Thailand, 2001.  [Google Scholar]). In this paper, we extend the latter work to certain subsemigroups of (P(X, Y ), *). We also consider the corresponding idea for partial linear transformations from one vector space into another. In this way, we generalise known results for total transformations and for injective partial transformations between sets, and we establish new results for linear transformations between vector spaces.     

On Finite Presentability of Direct Products of Semigroups

A finite semigroup S is said to preserve finite generation (resp., presentability) in direct products, provided that, for every infinite semigroup T, the direct product S × T is finitely generated (resp., finitely presented) if and only if T is finitely generated (resp., finitely presented). The main result of this paper is a constructive necessary and sufficient condition for S to preserve both finite generation and presentability in direct products. The condition is that certain graphs, (s), one for each s S, are all connected. The main result is illustrated in three examples, one of which exhibits a 4-element semigroup that preserves finite generation but not finite presentability in direct products.1991 Mathematics Subject Classification: 20M05, 05C25The first author is financially supported by the Sub-Programa Ciência e Tecnologia do 2° Quadro Comunitário de Apoio (grant number BD/ 15623/98). The author also acknowledges the support of the Centro de Álgebra da Universidade de Lisboa and of the Projecto Praxis 2/2.1/MAT/73/94. The second author acknowledges partial financial support from the Nuffield Foundation.     

Weakly Regular Semigroups of Isotone Transformations

Let X be a partially ordered set and O(X) be the semigroup of all mappings X → X that preserve the order, i.e., x ≤ y ? xα ≤ yα for all x, y ∈ X. It is proved that the semigroup O(X) is weakly regular in the wide sense if and only if at least one of the following conditions holds: (1) X is a quasi-complete chain; (2) the elements of X are not comparable pairwise; (3) X = Y ∪ Z, where y < z for y ∈ Y, z ∈ Z; (4) X = Y ∪ Z, where y ₀ ∈ Y, z ₀ ∈ Z, and y ₀ < z for z ∈ Z, y < z0 for y ∈ Y; (5) X = {a, c} ∪ B, where a < b < c for b ∈ B; (6) X = {1, 2, 3, 4, 5, 6}, where 1 < 4, 1 < 5, 2 < 5, 2 < 6, 3 < 4, 3 < 6. Moreover, if X is a quasi-ordered set but not partially ordered, then the semigroup O(X) is weakly regular in the wide sense if and only if x ≤ y for all x, y ∈ X.     

Computing Finite Semigroups, I: The First Row

New precedence results are obtained for finite, not necessarily commutative semigroups, which are used to further sharpen existing algorithms for the computation of finite semigroups. The results in this first part describe the first row of the multiplication table in detail and provide a numerical profile with which it can be compared to other rows.     

Semigroups That Contain All Singular Transformations

Given a transformation semigroup S over a finite set X we determine necessary and sufficient conditions on the generators of S in order that it contains all singular transformations.     

Certain Partial Orders on Semigroups

Relations introduced by Conrad, Drazin, Hartwig, Mitsch and Nambooripad are discussed on general, regular, completely semisimple and completely regular semigroups. Special properties of these relations as well as possible coincidence of some of them are investigated in some detail. The properties considered are mainly those of being a partial order or compatibility with multiplication. Coincidences of some of these relations are studied mainly on regular and completely regular semigroups.     

Nilpotent Ranks of Semigroups of Partial Transformations

A subset U of a semigroup S is a generating set for S if every element of S may be written as a finite product of elements of U. The rank of a finite semigroup S is the size of a minimal generating set of S, and the nilpotent rank of S is the size of a minimal generating set of S consisting of nilpotents in S. A partition of a q-element subset of the set X_n = {1,2,..., n} is said to be of type τ if the sizes of its classes form the partition τ of the positive integer q ≤ n. A non-trivial partition τ of q consists of k < q elements. For a non-trivial partition τ of q < n, the semigroup S(τ), generated by all the transformations with kernels of type τ, is nilpotent-generated. We prove that if τ is a non-trivial partition of q < n, then the rank and the nilpotent rank of S(τ) are both equal to the number of partitions X_n of type τ.     

On Finite Complete Presentations and Exact Decompositions of Semigroups

We prove that given a finite (zero) exact right decomposition (M, T) of a semigroup S, if M is defined by a finite complete presentation, then S is also defined by a finite complete presentation. Exact right decompositions are natural generalizations to semigroups of coset decompositions in groups. As a consequence, we deduce that any Zappa–Szép extension of a monoid defined by a finite complete presentation, by a finite monoid, is also defined by such a presentation.

It is also proved that a semigroup M ⁰[A; I, J; P], where A and P satisfy some very general conditions, is also defined by a finite complete presentation.     

The Full Transformation Semigroups of Finite Rank are Amalgamation Bases for Finite Semigroups

In this article, we prove that the full transformation semigroup on a finite set is an amalgamation base for finite semigroups.     

On the Finite and Non-finite Generation of Finitary Power Semigroups

The finitary power semigroup of a semigroup S, denoted P_f(S), is the set of finite subsets of S with respect to the usual set multiplication. Semigroups with finitely generated finitary power semigroups are characterised in terms of three other properties. From this statement there are drawn several corollaries. It follows that P_f(S) is not finitely generated if S is infinite and in any of the following classes: commutative; Bruck-Reilly extensions; inverse semigroups that contain an infinite group; completely zero-simple; completely regular.     

On Relative Ranks of Finite Transformation Semigroups with Restricted Range

Ukrainian Mathematical Journal - We determine the relative rank of the semigroup $$ \mathcal{T}\left(X,Y\right) $$ of all transformations on a finite chain X with restricted range...