✦ LIBER ✦

Counting complements in the partition lattice, and hypertrees

✍ Scribed by Daniel Grieser

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 290 KB
Volume: 57
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(91)90012-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Order-matchings in the partition lattice

✍ Murali K Srinivasan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Anomaly in the lattice partition functio

Anomaly in the lattice partition function

✍ M. Hachi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Complements and quasicomplements in the

Complements and quasicomplements in the lattice of subalgebras of P(ω)

✍ Ivo Düntsch; Sabine Koppelberg 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Counting solitons and phonons in the Tod

Counting solitons and phonons in the Toda lattice

📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Partitioning the lattice points in Rn

✍ Jerome L. Paul 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Complementation in the lattice of equiva

Complementation in the lattice of equivalence relations

✍ Dikran Dikranjan; Alberto Policriti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 646 KB

The aim of this paper is to study those pairs of complementary equivalence relations on a fixed set which are maximal as families of mutually complementary equivalence relations. The existence of such pairs on uncountable sets was proved by Steprgns and Watson (1995). They conjectured that such pair