On maximal shadows of members in left-compressed sets (Q1305086)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On maximal shadows of members in left-compressed sets |
scientific article; zbMATH DE number 1340622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On maximal shadows of members in left-compressed sets |
scientific article; zbMATH DE number 1340622 |
Statements
On maximal shadows of members in left-compressed sets (English)
0 references
7 March 2000
0 references
The poset \(L(k,m)\) of the proper shading of a \(k \times m\) grid is heavily studied by (among others) R. Stanley and R. A. Proctor. They focused on antchains and the strong Sperner property. This paper investigates the shadows of subsets of \(L(k,m)\) and derives asymptotic bounds on their size.
0 references
shadow
0 references
compressed set
0 references
proper shading
0 references
hard Lefschetz theorem
0 references
representation of Lie algebras
0 references
0.83501935
0 references
0.8327597
0 references
0 references
0.8261509
0 references
0.82176405
0 references
0.8150015
0 references
0.8131933
0 references
