Endomorphisms of the semigroup of order-preserving mappings

We characterize the endomorphisms of the semigroup of all order-preserving mappings on a finite chain. We show that there are three types of endomorphism: automorphisms, constants, and a certain type of endomorphism with two idempotents in the image.     

Nilpotents in semigroups of partial one-to-one order-preserving mappings

Communicated by R. B. McFadden     

Semigroups of mappings on graphs

At present, there are quite a few investigations in the theory of semigroups devoted to semigroups of mappings on graphs. Up to now, endomorphism semigroups of graphs, extensive transformation semigroups of graphs, coloring semigroups of graphs and other semigroups of special mappings on graphs have been studied. The results obtained show the way graphs are determined by the above-mentioned semigroups. They also show the structure of semigroups of mappings and interrelations between properties of graphs and corresponding properties of semigroups associated with the graphs. This paper gives a survey of the main results in this field.     

On divisors of semigroups of order-preserving mappings of a finite chain

We show that if a semigroup T divides a semigroup of full order preserving transformations of a finite chain, then so does any semidirect product S⋊T where S is a finite semilattice whose natural order makes S a chain.     

On order-preserving and order-reversing mappings defined on cones of convex functions

In this paper,we first show that for a Banach space X,there is a fully order-reversing mapping T from conv(X)(the cone of all the extended real-valued lower semicontinuous proper convex functions defined on X) onto itself if and only if X is reflexive and linearly isomorphic to its dual X~*.Then we further prove the following generalized Artstein-Avidan-Milman representation theorem:For every fully order-reversing mapping T:conv(X)→conv(X),there exist a linear isomorphism U:X→X~*,x_0~*,φ_0∈X~*,α0 and r_0∈R so that(Tf)(x)=α(Ff)(Ux+x_0~*)+φ_0,x+r_0,■x∈X where T:conv(X)→conv(X~*) is the Fenchel transform.Hence,these resolve two open questions.We also show several representation theorems of fully order-preserving mappings defined on certain cones of convex functions.For example,for every fully order-preserving mapping S:semn(X)→ semn(X),there is a linear isomorphism U:X→ X so that(Sf)(x)=f(Ux),■f∈semn(X),x∈X where semn(X) is the cone of all the lower semicontinuous seminorms on X.     

Semigroups of mappings with rigid Lipschitz constant

It is shown that two well-known uniformly fixed point free lipschitzian semigroups of mappings have minimal Lipschitz constant on the positive part of the unit ball of . This implies that a question raised by T. Kuczumow has a negative answer.

     

Semigroups generated by pseudo-contractive mappings under the Nagumo condition

Let X be a Banach space whose dual space X^∗ is uniformly convex. We demonstrate that, for any demicontinuous, weakly Nagumo, k-pseudo-contractive mapping T:D(T)⊆X→X with closed domain, A=T−I weakly generates a semigroup on D(T). In this paper, we project the consequences of this result on fixed point theory. In particular, we show that if k<1 (id est, if T is strongly pseudo-contractive), then T has a unique fixed point. This implies that, if T is pseudo-contractive (k=1) and D(T) is closed, bounded, and convex, then T has at least one fixed point. Consequently, any demicontinuous pseudo-contractive mapping T:C→C (for an appropriate C) has a fixed point, which has been an important open question in fixed point theory for quite some time. In a subsequent paper, we explore the consequences of the semigroup result on the existence of solutions to certain partial differential equations. The semigroup result directly implies the existence of unique global solutions to time evolution equations of the form u^′=Au where A is a combination of derivatives. The fixed point results from this paper imply the existence of solutions to partial differential equations of the form Lu=f.     

Recognition of order-preserving maps

The following algorithmic problem is considered. Let P and Q be finite partially ordered sets. Given an unknown order-preserving map f: P→Q what is the minimum number of evaluations of f on elements of P which are needed to determine f completely in the worst case? Here the algorithms considered are ‘adaptive’, in the sense that the choice of the next element x of P for which f (x) is requested, can depend on the information gathered so far. Bounds are given for this minimum number. It is determined exactly in the case that P satisfies certain conditions.     

Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs

The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount rate may be negative. We characterize the minimality of a fixed point in terms of the nonlinear spectral radius of a certain semidifferential. We apply this characterization to design a policy iteration algorithm, which applies to the case of finite state and action spaces. The algorithm returns a locally minimal fixed point, which turns out to be globally minimal when the discount rate is nonnegative.     

Semigroups of order preserving mappings on a finite chain: A new class of divisors

In this paper we aim to prove that every semigroup of the pseudovariety generated by all semigroups of partial, injective and order preserving transformations on a finite chain belongs to the pseudovariety generated by all semigroups of order preserving mappings on a finite chain. This research was done within the project SAL (JNICT, PBIC/C/CEN/1021/92), and the activities of the “Centro de álgebra da Universidade de Lisboa”.     

Generalized Bicyclic Semigroups and Jones Semigroups

In this paper, we consider the generalized bicyclic semigroups B_n = a, b | aⁿb = 1 and the Jones semigroups A_n = a, b | aⁿ⁺¹b = a. They are the generalizations of the bicyclic semigroup B = a, b | ab = 1 and its analogous semigroup A = a, b | a²b = a discovered by P.R., Jones in 1987. The word problem for these kinds of semigroups is solved. It is proved that, for n 2, B_n are bisimple right inverse but not inverse semigroups and that the semigroup C = a, b | a²b = a, ab² = b is the smallest idempotent-free homomorphic image of A_n. Moreover, we also prove that A_n and A_m are mutually embeddable but not isomorphic with each other if n m. As a consequence, different kind of -nontrivial [0-]simple semigroups without idempotents are discussed.AMS 1991 Subject Classification: primary 20M10 secondary 20M05.Supported by NNSF of China (19671063) and KSRF of Sichuan Education Committee ([1999]127).     

Posets whose monoids of order-preserving maps are regular

The purpose of this paper is to determine all posetsP such that the monoid of all order-preserving maps ofP intoP is regular in the semigroup-theoretic sense. AMS subject classifications (1980). 06A10, 20M20.     

一类Clifford半群的幂半群

Let S =∪（Gα ： α ∈ E） be a semilattice of groups（i.e., a Cliford semigroup） and n a natural number. E is called an n-element chain of groups if it is an n-element chain. Denote by Cn the set of all n-element chains of groups. In this paper we shall show that for any natural number n, the class of semigroups Cn satisfies the strong isomorphism property.     

广义双循环半群和Jones半群

本文刻画了广义双循环半群Ｂｎ＝〈ａ,ｂ｜ａ＾ｎｂ＝１〉和Ｊｏｎｅｓ半群Ａｎ＝〈ａ,ｂ｜ａ＾ｎ＋１ｂ＝ａ〉（ｎ≥１）的结构;证明了每个Ａｎ都具有Ｐ．Ｒ．Ｊｏｎｅｓ所发现的半群Ａ＝〈ａ,ｂ｜ａ＾２ｂ＝ａ〉的所有重要性质,特别地,证明了Ａｎ,Ａｍ可互相嵌入,从而得到：第三个Ｄ－非平凡的无幂等元「０－」单半群若不含Ｃ＝〈ａ,ｂ｜ａ＾２ｂ＝ａ,ａｂＴ＾２＝ｂ〉,则必含每个Ａｎ或它们的对偶,作为推论,每人广义     

Power Semigroups of a Class of Cliford Semigroups

Let S =∪(Gα : α∈ E) be a semilattice of groups(i.e., a Cliford semigroup) and n a natural number. E is called an n-element chain of groups if it is an n-element chain. Denote by Cn the set of all n-element chains of groups. In this paper we shall show that for any natural number n, the class of semigroups Cn satisfies the strong isomorphism property.