๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the greedy dimension of a partial order

โœ Scribed by V. Bouchitte; M. Habib; R. Jegou


Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
279 KB
Volume
1
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper introduces a new concept of dimension for partially ordered sets. Dushnik and Miller in 1941 introduced the concept of dimension of a partial order P, as the minimum cardinality of a realizer, (i.e., a set of linear extensions of P whose intersection is P). Every poser has a greedy realizer (i.e., a realizer consisting of greedy linear extensions). We begin the study of the notion of greedy dimension of a poser and its relationship with the usual dimension by proving that equality holds for a wide class of posets including N-free posets, two-dimensional posets and distributive lattices.


๐Ÿ“œ SIMILAR VOLUMES


The greedy algorithm for partially order
โœ 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

Partial orders of dimension 2
โœ K. A. Baker; P. C. Fishburn; F. S. Roberts ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 873 KB