Matchings and Radon transforms in lattices. I: Consistent lattices (Q1068863): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:04, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matchings and Radon transforms in lattices. I: Consistent lattices |
scientific article |
Statements
Matchings and Radon transforms in lattices. I: Consistent lattices (English)
0 references
1985
0 references
An element in a lattice is join-irreducible if \(x=a\vee b\) implies \(x=a\) or \(x=b\). A meet-irreducible is a join-irreducible in the order dual. A lattice is consistent if for every element x and every join-irreducible j, the element \(x\vee j\) is a join-irreducible in the upper interval [x,1]. This paper shows that in a finite consistent lattice, the incidence matrix of meet-irreducibles versus join-irreducibles has rank the number of join-irreducibles. Since modular lattices and their order duals are consistent, this settles a conjecture of Rival on matchings in modular lattices.
0 references
finite consistent lattice
0 references
incidence matrix
0 references
meet-irreducibles
0 references
join- irreducibles
0 references
matchings in modular lattices
0 references