Combinatorial inequalities for semimodular lattices of breadth two

DOI10.1007/BF02485838zbMath0423.06008MaRDI QIDQ1134169

Ivan Rival

Publication date: 1976

Published in: Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

join irreducible elementsdoubly irreducible elementsfinite modular dismantlable latticefinite semimodular lattices

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Semimodular lattices, geometric lattices (06C10)

Related Items

Matchings for linearly indecomposable modular lattices ⋮ Subdiagrams equal in number to their duals ⋮ A proof of Frankl's union-closed sets conjecture for dismantlable lattices ⋮ Unnamed Item ⋮ Continuous modular lattices of breadth two ⋮ Matching in modular lattices ⋮ Consistent dually semimodular lattices ⋮ Matchings and Radon transforms in lattices II. Concordant sets ⋮ An arithmetical theorem for modular lattices ⋮ Path length in the covering graph of a lattice ⋮ Medians are below joins in semimodular lattices of breadth 2 ⋮ Obituary: Ivan Rival ⋮ Weak bases in modular lattices ⋮ Matchings and Radon transforms in lattices. I: Consistent lattices ⋮ Varieties generated by lattices of breadth two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zur Kennzeichnung der Dedekind-MacNeilleschen Hülle einer geordneten Menge
• Dilworth's covering theorem for modular lattices: A simple proof
• Sublattices generated by chains in modular topological lattices
• A decomposition theorem for partially ordered sets
• Proof of a conjecture on finite modular lattices
• Hüllensysteme und Erweiterung von Quasi‐Ordnungen
• Lattices with Doubly Irreducible Elements
• Planar Lattices
• A rank inequality for finite geometric lattices
• Partially Ordered Sets