Proof of a conjecture on finite modular lattices
From MaRDI portal
Publication:2651978
Cited in
(21)- Diagrams for modular lattices
- Matchings and Radon transforms in lattices. I: Consistent lattices
- Matchings for linearly indecomposable modular lattices
- Subdiagrams equal in number to their duals
- Combinatorial inequalities for semimodular lattices of breadth two
- Matching in modular lattices
- Consistent dually semimodular lattices
- Dilworth's covering theorem for modular lattices: A simple proof
- An arithmetical theorem for modular lattices
- Obituary: R. P. Dilworth
- A property of the hyperplanes of a matroid and an extension of Dilworth's theorem
- Right \(l\)-groups, geometric Garside groups, and solutions of the quantum Yang-Baxter equation
- Matchings and Radon transforms in lattices II. Concordant sets
- Dual Symmetry of Projective Sets in a Finite Modular Lattice
- Whitney Number Inequalities for Geometric Lattices
- Intersection graph of a module
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Application of the join-irreducible excess function to semi-modular lattices
- On the length of the sublattice-lattice of a finite distributive lattice
- Optimal matchings in posets
- Counting formulas for glued 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)