Sur les demi-groupes reticules et les o-demi-groupes

A necessary and sufficient condition is given in order that a lattice-ordered semigroup admit a totally ordered ?-homomorphic image (Theorem 1). This permits us to give (Theorem 2) a necessary and sufficient condition that a lattice-ordered semigroup be representable, that is, that it be ?-isomorphic to a subdirect product of totally ordered semigroups, thereby solving a problem posed by L. Fuchs ([2], p. 289). We also establish a necessary and sufficient condition that a semigroup be an o-semigroup, that is, that it admit a structure of totally ordered semigroup (Theorem 3).     

紧交换半群上概率测度卷积序列的极限性质

本文用“部分群化”的方法研究紧交换半群上概率测度的极限性质.§3讨论 i.i.d 的情形,将紧群上的 Kawada-It(?)型结果以相应的形式建立到紧交换半群上.§4讨论独立非同分布的情形,建立了紧交换半群上的强 Kloss 收敛准则,它曾由苏联学者 Maksimov先后在有限群([1])与紧群上([2])得到.     

A condition for constructing formally real monoid algebras

In this paper we demonstrate that every positive totally ordered commutative monoid on 2 generators satisfying a weak cancellation property is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. In [1], the current author, along with Evans, Konikoff, Mathis, and Madden, employed the work of Hion, [5], to demonstrate that the monoid ring of all finite formal sums over a totally ordered domain is a formally real totally ordered ring providing the totally ordered monoid satisfies this weak cancellation property and is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. Therefore, we provide here significant information about a condition for the construction of formally real totally ordered monoid algebras. Received November 4, 2003; accepted in final form November 18, 2004.     

Continuous Utility Representation Theorems in Arbitrary Concrete Categories

In this paper the continuous utility representation problem will be discussed in arbitrary concrete categories. In particular, generalizations of the utility representation theorems of Eilenberg, Debreu and Estévez and Hervés will be presented that also hold if the codomain of a utility function is an arbitrary totally ordered set and not just the real line. In addition, we shall prove and apply a general result on the characterization of structures that have the property that every continuous total preorder has a continuous utility representation. Finally, generalizations of the utility representation theorems of Debreu and Eilenberg will be discussed that are valid if we consider arbitrary binary relations and allow a utility function to have values in an arbitrary totally ordered set.      

The existence and structure of Irr(X)

It has been shown that, for a compact totally ordered set X, the category of irreducible semigroups with idempotents X and idempotent separating homomorphisms has a generator, Irr(X) [7]. In this article we outline the proof of the existence of Irr(X), along with the results obtained previously about the existence of Irr(X). We also survey the known results about the structure of an Irr(X) and about its uniqueness. These latter results were obtained by K. H. Hofmann and the author in a seminar on compact semigroups at Tulane University during the academic year 1970–1971. Supported by NSF Grant GP28655.     

Pathwise Duals of Monotone and Additive Markov Processes

This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and whose generator can be represented in monotone maps has a pathwise dual process. In the special setting of attractive spin systems, this has been discovered earlier by Gray. We show that the dual simplifies a lot when the state space is a lattice (in the order-theoretic meaning of the word) and all monotone maps satisfy an additivity condition. This leads to a unified treatment of several well-known dualities, including Siegmund’s dual for processes with a totally ordered state space, duality of additive spin systems, and a duality due to Krone for the two-stage contact process, and allows for the construction of new dualities as well. We show that the well-known representation of additive spin systems in terms of open paths in a graphical representation can be generalized to additive Markov processes taking values in general lattices, but for the process and its dual to be representable on the same underlying space, we need to assume that the lattice is distributive. In the final section, we show how our results can be generalized from finite state spaces to interacting particle systems with finite local state spaces.     

CS-indecomposable ordered semigroups

An ordered semigroup S is called CS-indecomposable if the set S × S is the only complete semilattice congruence on S. In the present paper we prove that each ordered semigroup is, uniquely, a complete semilattice of CS-indecomposable semigroups, which means that it can be decomposed into CS-indecomposable components in a unique way. Furthermore, the CS-indecomposable ordered semigroups are exactly the ordered semigroups that do not contain proper filters. Bibliography: 6 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 343, 2007, pp. 222–232.     

Quasi-uniformities on topological semigroups and bicompletion

We study the bicompletion of the quasi-uniformities that are induced in a natural way on a topological semigroup which has a neutral element. In particular, we show that if X is a topological semigroup, with neutral element, for which the left translations are open, then the bicompletion of the left quasi-uniformity of X can be considered a topological semigroup which contains the topological space X as a sup-dense subsemigroup. The bicompletion in the case that the left translations are not necessarily open is also discussed. In particular, both Abelian and left-cancellable topological semigroups are considered. For semigroups which are (left-)cancellable or which are locally totally bounded, theorems similar to those known from the classical theory of (para)topological groups are established. July 1, 1999     

偏序半群的C-左理想

本文引入了偏序半群中Ｃ 左理想的概念，讨论了Ｃ 左理想的一些基本性质，定义了左基的概念并利用它给出了最大Ｃ 左理想存在的必要和充分条件．作为应用，本文还讨论了每个真左理想均为Ｃ 左理想和无Ｃ 左理想这两类半群的结构特征．本文的结果在一般半群中也成立     

On local integrability and transience of convolution semigroups of measures

The analytic proof due to M. Itô of the Kesten-Ornstein transience criterion for continuous convolution semigroups of nonnegative contraction measures on a compactly generated Abelian locally compact group has been reworked and given a self-contained form. The new proof still relies on the existence of the equilibrium measure but dispenses with the complete maximum principle.     

Probabilistic Number Theory in Additive Arithmetic Semigroups, III

We extend the investigation of quantitative mean-value theorems of completely multiplicative functions on additive arithmetic semigroups given in our previous paper. Then the new and old quantitative mean-value theorems are applied to the investigation of local distribution of values of a special additive function *(a). The result is unexpected from the point of view of classical number theory. This reveals the fact that the essential divergence of the theory of additive arithmetic semigroups from classical number theory is not related to the existence of a zero of the zeta function Z(y) at y = –q ^–1.     

关于序半群的模糊拟理想

In this paper,fuzzy quasi-ideals of ordered semigroups are characterized by the properties of their level subsets.Furthermore,we introduce the notion of completely semiprime fuzzy quasi-ideals of ordered semigroups and characterize strongly regular ordered semigroups in terms of completely semiprime fuzzy quasi-ideals.Finally,we investigate the characterizations and decompositions of left and right simple ordered semigroups by means of fuzzy quasi-ideals.     

On the supports of absolutely continuous Gauss measures on connected Lie groups

The behaviour of the supports of an absolutely continuous Gauss semigroup on certain Lie groups is discussed. It is shown that on a connected nilpotent Lie group any absolutely continuous Gauss semigroup has full supports but on compact connected Lie groups which are not Abelian there exist absolutely continuous Gauss semigroups which do not have common supports.     

Ordered optimal solutions and parametric minimum cut problems

In this paper, we present an algebraic sufficient condition for the existence of a selection of optimal solutions in a parametric optimization problem that are totally ordered, but not necessarily monotone. Based on this result, we present necessary and sufficient conditions that ensure the existence of totally ordered selections of minimum cuts for some classes of parametric maximum flow problems. These classes subsume the class studied by Arai et al. [Discrete Appl. Math. 41 (1993) 69–74] as a special case.     

Totally ordered uncertain sets

It is known that some uncertain sets have membership functions, and some do not. How do we judge whether an uncertain set has a membership function? In order to answer this question, this paper presents a concept of totally ordered uncertain set, and shows that totally ordered uncertain sets always have membership functions if they are defined on a continuous uncertainty space. In addition, some criteria for judging the existence of membership functions for uncertain sets are provided. Several inspiring examples and counterexamples are also documented in this paper.     

Order Embeddings with Irrational Codomain: Debreu Properties of Real Subsets

The objective of this paper is to investigate the role of the set of irrational numbers as the codomain of order-preserving functions defined on topological totally preordered sets. We will show that although the set of irrational numbers does not satisfy the Debreu property it is still nonetheless true that any lower (respectively, upper) semicontinuous total preorder representable by a real-valued strictly isotone function (semicontinuous or not) also admits a representation by means of a lower (respectively, upper) semicontinuous strictly isotone function that takes values in the set of irrational numbers. These results are obtained by means of a direct construction. Moreover, they can be related to Cantor’s characterization of the real line to obtain much more general results on the semicontinuous Debreu properties of a wide family of subsets of the real line.      

Type 1 representable lattices of dimension at most 4

We prove that every lattice of length (formerly, dimension) at most 4, representable by commuting equivalence relations, is also representable by subgroups of an Abelian group.     

On a Class of Lattice Ordered Inverse Semigroups

It is well known that the free group on a non-empty set can be totally ordered and, further, that each compatible latttice ordering on a free group is a total ordering. On the other hand, Saitô has shown that no non-trivial free inverse semigroup can be totally ordered. In this note we show, however, that every free inverse monoid admits compatible lattice orderings which are closely related to the total orderings on free groups.These orderings are natural in the sense that the imposed partial ordering on the idempotents coincides with the natural partial ordering. For this to happen in a lattice ordered inverse semigroup, the idempotents must form a distributive lattice. The method of construction of the lattice orderings on free inverse monoids can be applied to show that naturally lattice ordered inverse semigroups with a given distributive lattice E of idempotents can have arbitrary Green's relation structure. Analogous results hold for naturally -semilatticed inverse semigroups. In this case, there is no restriction on the semilattice E of idempotents.We also show that every compatible lattice ordering on the free monogenic inverse monoid is of the type considered here. This permits us to prove that there are precisely eight distinct compatible lattice orderings on this semigroup. They belong to two families, each of which contains four members, of conjuguate lattice orderings.     

Exchangeable Random Ordered Trees by Positive Definite Functions

We prove that the set of exchangeable random totally ordered trees is a Bauer simplex whose extreme points are the generalized paint-box processes. The method is based on semigroups, analogous to Hirth and Ressel,^{(2, 3)} and is readily also applied to inverse trees.