The lattice theory of r-ordered partitions
โ Scribed by Michel Serfati
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 934 KB
- Volume
- 194
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper deals with ordered patitions of a set (indexed by some integer r) considered as 'natural' extensions of subsets, mainly from the lattice theory viewpoint (secondary, ring theory aspects). The present theory is in fact a (complete) set-theoretical realization of general Post algebras. This study --which we had briefly sketched in a previous paper (Serfati . cf. Chap. G., L'alg~bre de Post des r-partitions ordonnfes d'un ensemble, 35-37) --is completely defined here and developed to a full extent.
Resum6
Cet article est consacr6 aux partitions ordonn~es d'un ensemble f2 (index~es par un entier r), considfrfes comme des extensions 'naturelles' des sous-ensembles de ~, essentiellement du point de vue des treillis (et, secondairement, de celui des anneaux). La thforie ici prfsentfe est en fait une rfalisation ensembliste compl&e des alg~bres de Post abstraites. Cette 6tude-que nous avions bri~vement esquissfe dans un prfcfdent article (Serfati [5]. cf. Chap. G., L'algbbre de Post des r-partitions ordonnfes d'un ensemble, 35-37) --est ici redffinie et developpfe d'une faqon complbte. (~) 1999 Elsevier Science B.V. All fights reserved
O. Introduction and preliminaries
We use the following notations: supremum and infimum of any two elements x and y of a lattice T will be denoted by x V y and x A y. If it exists, the supremum (resp. infimum) of any indexed family xi (i C 1) of elements of T will be denoted by
~1 Xi (resP'i~lXi) "
Universal elements (if they exist) will be denoted by 0 and 1: that is T is a (0, 1)lattice. Recall that in any (0, 1)-distributive lattice, the set of all the complemented
๐ SIMILAR VOLUMES
The lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeling, maximal chains give rise to permutations. We discuss structural and enumerative properties of the lattice of noncrossing partitions, which pertain to a new permutation statistic, m(a), defined as the num
Simion, R. and D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Mathematics 98 (1991) 193-206. We show that the lattice of noncrossing (set) partitions is self-dual and that it admits a symmetric chain decomposition. The self-duality is proved via an order-reversing i
In this paper, we introduce the concept of a valuation mapping of an l-group G onto a distributive lattice and use such valuations to investigate the structure of G. Then we examine the maximal immediate extensions of G with respect to these ลฝ valuations. For the natural valuation, these are the arc
## A new construction for the orthocompletion of an l-group is given and discussed. Its relation to the Z-group of almost-kite continuous real-valued functions on a Stone space is clarified.