✦ LIBER ✦

A characterization of relatively balanced lattices

✍ Scribed by Tetsuya Abe

Publisher: Springer
Year: 2002
Tongue: English
Weight: 145 KB
Volume: 47
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s00012-002-8172-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On balanced lattices and Goldie dimensio

On balanced lattices and Goldie dimension of balanced lattices

✍ A. P. ZolotarËv 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 597 KB

The order dimension of relatively free l

The order dimension of relatively free lattices

✍ J. B. Nation; J. H. Schmerl 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 157 KB

On the covering graph of balanced lattic

On the covering graph of balanced lattices

✍ Manfred Stern 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Jakubik has shown that for discrete modular lattices all graph isomorphisms are given by certain direct product decompositions. Duffus and Rival have proved a similar theorem for graded lattices which are atomistic and coatomistic. Modifying some of the results of Duffus and Rival we give a common g

A note on supermodular sublattices in fi

A note on supermodular sublattices in finite relatively complemented lattices

✍ Andrei Krokhin; Benoit Larose 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 109 KB

A characterization of root lattices

✍ Dayanand S. Rajan; Anil M. Shende 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 242 KB

A characterization of totally balanced h

A characterization of totally balanced hypergraphs

✍ Jenö Lehel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 418 KB

A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru