Proof of a conjecture on finite modular lattices
From MaRDI portal
Publication:2651978
DOI10.2307/1969639zbMATH Open0056.26203OpenAlexW4247214039WikidataQ56455888 ScholiaQ56455888MaRDI QIDQ2651978FDOQ2651978
Publication date: 1954
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969639
Cited In (21)
- Subdiagrams equal in number to their duals
- Optimal matchings in posets
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Matchings and Radon transforms in lattices. I: Consistent lattices
- Counting formulas for glued lattices
- Diagrams for modular lattices
- Dual Symmetry of Projective Sets in a Finite Modular Lattice
- Application of the join-irreducible excess function to semi-modular lattices
- Matchings and Radon transforms in lattices II. Concordant sets
- Whitney Number Inequalities for Geometric Lattices
- Right \(l\)-groups, geometric Garside groups, and solutions of the quantum Yang-Baxter equation
- INTERSECTION GRAPH OF A MODULE
- A property of the hyperplanes of a matroid and an extension of Dilworth's theorem
- Obituary: R. P. Dilworth
- Combinatorial inequalities for semimodular lattices of breadth two
- Consistent dually semimodular lattices
- On the length of the sublattice-lattice of a finite distributive lattice
- Matching in modular lattices
- Dilworth's covering theorem for modular lattices: A simple proof
- Matchings for linearly indecomposable modular lattices
- An arithmetical theorem for modular lattices
This page was built for publication: Proof of a conjecture on finite modular lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2651978)
