Subdiagrams equal in number to their duals (Q1088695): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Ivan Rival / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gudrun Kalmbach / rank | |||
Revision as of 11:36, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Subdiagrams equal in number to their duals |
scientific article |
Statements
Subdiagrams equal in number to their duals (English)
0 references
1986
0 references
A subdiagram S of an ordered set P is a cover-preserving ordered subset of P. If S is finite, \(\ell (S)\neq 2\) and S is, as a down set, embedded in a selfdual lattice of subspaces of a projective geometry then the authors prove that S is a ''dual subdiagram invariant'' which means: For any modular lattice M, the number of subdiagrams of M isomorphic to S equals the number of subdiagrams of M dually isomorphic to S.
0 references
lattice of subspaces of a projective geometry
0 references
modular lattice
0 references
subdiagrams
0 references
dually isomorphic
0 references