𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Retract extensions of ordered sets

✍ Scribed by N. Kehayopulu; J. S. Ponizovskii; K. P. Shum


Publisher
Springer US
Year
2006
Tongue
English
Weight
365 KB
Volume
136
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimizing bumps in linear extensions of
✍ Peter C. Fishburn; William V. Gehrlein πŸ“‚ Article πŸ“… 1986 πŸ› Springer Netherlands 🌐 English βš– 650 KB

A linear extension x,x2xs ... of a partially ordered set (X, <) has a bump whenever xi < xi+l. We examine the problem of determining linear extensions with as few bumps as possible. Heuristic algorithms for approximate bump minimization are considered. AhfS (MOS) subject classifications (1980). Prim

Extensions of ordered sets having the fi
✍ John Ginsburg πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 892 KB

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being c