✦ LIBER ✦

Semigroups of order preserving partial transformations of a totally ordered set

✍ Scribed by N.R Reilly

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 1015 KB
Volume: 22
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(72)90158-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning retracts of a partially ordered

Spanning retracts of a partially ordered set

✍ D. Duffus; I. Rival; M. Simonovits 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Two general kinds of subsets of a partially ordered set P are always retracts of P:: (1) every maximal chain of P is a retract; (2) in P, every isometric, spanning subset of length one with no crowns is a retract. It follows that in a partially ordered set P with the fixed point property, every maxi

Canonical modules of partially ordered s

Canonical modules of partially ordered sets

✍ Kenneth Baclawski 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Some homological properties of partially

Some homological properties of partially ordered sets

✍ Andrea Brini 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Flag Vectors of Eulerian Partially Order

Flag Vectors of Eulerian Partially Ordered Sets

✍ Margaret M. Bayer; Gábor Hetyei 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 244 KB

The closed cone of flag vectors of Eulerian partially ordered sets is studied. A new family of linear inequalities valid for Eulerian flag vectors is given. Half-Eulerian posets are defined. Certain limit posets of Billera and Hetyei are half-Eulerian; they give rise to extreme rays of the cone for

A partially ordered set of functionals c

A partially ordered set of functionals corresponding to graphs

✍ Alexander Sidorenko 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 776 KB

For a graph G whose vertices are vl, u2, . . . , v, and where E is the set of edges, we define a functional U,(h)= ss SC . . . frl,$EEh(Xi,Xj) > dPc(x~)dAxJ ... dp(x,), where h is a nonnegative symmetric function of two variables. We consider a binary relation + for graphs with fixed numbers of vert

The lattice of antichain cutsets of a pa

The lattice of antichain cutsets of a partially ordered set

✍ Gerhard Behrendt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 125 KB

## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order