✦ LIBER ✦

The morphology of partially ordered sets

✍ Scribed by L.H Harper

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 674 KB
Volume: 17
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90027-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partially homogeneous partially ordered

Partially homogeneous partially ordered sets

✍ Dan Saracino; Carol Wood 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 421 KB

On the dimension of partially ordered se

On the dimension of partially ordered sets

✍ Oliver Pretzel 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Matroids on Partially Ordered Sets

✍ Marilena Barnabei; Giorgio Nicoletti; Luigi Pezzoli 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 346 KB

## L dimension may be chosen within each of the subspaces L in the set S that are ''in general position.'' For example, in the real projective space of dimension 3, consider a plane , a line r not belonging to , the point P [ r l , and two distinct points Q, R both different from P, lying on the l

Shaprly transitive partially ordered set

Shaprly transitive partially ordered sets

✍ Gerhard Behrendt 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 506 KB

We call a partially ordered set A sharply transitive if its group of order automorphisms is sharply transitive on A, that is, if it is transitive on A and every non-trivial automorphism has no fixed points. We show that the direct product of any finite group with an infinite cyclic group is the auto

Canonical modules of partially ordered s

Canonical modules of partially ordered sets

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

The greedy algorithm for partially order

The greedy algorithm for partially ordered sets

✍ Ulrich Faigle 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works. 'Fhe greedy ulgsrithm far gtartIally ordered fete