𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some optimal algorithms for decomposed partially ordered sets

✍ Scribed by Vijay K. Garg

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
428 KB
Volume
44
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Galois Connections for Incidence Hopf Al
Galois Connections for Incidence Hopf Algebras of Partially Ordered Sets
✍ Marcelo Aguiar; Walter Ferrer Santos πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 277 KB

An important well-known result of Rota describes the relationship between the Mo bius functions of two posets related by a Galois connection. We present an analogous result relating the antipodes of the corresponding incidence Hopf algebras, from which the classical formula can be deduced. To motiva