✦ LIBER ✦

Annihilator characterizations of Boolean rings and Boolean lattices

✍ Scribed by E. M. Vechtomov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1993
Tongue: English
Weight: 483 KB
Volume: 53
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01208314

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of finite BOOLEan lat

A characterization of finite BOOLEan lattices

✍ Juhani Nieminen 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

Cutsets of Boolean lattices

✍ Richard Nowakowski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F U {a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined

Iterative characterizations of Boolean a

Iterative characterizations of Boolean algebras

✍ Dan Simovici; Corina Reischer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Algebraic lattices and Boolean algebras

✍ C. Jayaram 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 517 KB

Witt rings and associated Boolean rings

✍ Joseph L Yucas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Partitions of large Boolean lattices

✍ Zbigniew Lonc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Let 2" be the ordered set obtained from the Boolean lattice 2" by deleting both the greatest and the least elements. Definef(n) to be the minimum number k such that there is a partition of 2" into k antichains of the same size except for at most one antichain of a smaller size. In the paper we exami