𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Set-Valued Utilities for Strict Partial Orders

✍ Scribed by Carmen Herrero; Begoña Subiza

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
120 KB
Volume
43
Category
Article
ISSN
0022-2496

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

Representation theorems for graphs whose
Representation theorems for graphs whose the vertex set is partially ordered
✍ Alain Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 768 KB

## Dedicated to E. Corominas Given a graph G =(X, E), we try to know when it is possible to consider G as the intersection graph of a finite hypergraph, when some restrietions are given on the inclusion order induced on the edge set of this hypergraph. We give some examples concerning the interva