The normalized matching property from the generalized Macaulay theorem (Q1904384): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3741626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Divisors of a Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a combinatorial theorem of macaulay / rank
 
Normal rank
Property / cites work
 
Property / cites work: The morphology of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Matching in Direct Products of Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050598 / rank
 
Normal rank

Latest revision as of 07:57, 24 May 2024

scientific article
Language Label Description Also known as
English
The normalized matching property from the generalized Macaulay theorem
scientific article

    Statements

    The normalized matching property from the generalized Macaulay theorem (English)
    0 references
    0 references
    0 references
    5 June 1996
    0 references
    The normalized matching property for multisets asserts that the density of a family \(\mathcal A\) of \(k\)-element subsets of a multiset \(M\) in the family of all \(k\)-element subsets never exceeds the density of its shadow \(\Delta{\mathcal A}\) in the \((k-1)\)-element subsets. It is shown that this well-established result can be obtained as a corollary to the generalized Macaulay theorem of the author and \textit{B. Lindström} [J. Comb. Theory 7, 230-238 (1969; Zbl 0186.01701)].
    0 references
    normalized matching property
    0 references
    multiset
    0 references
    density
    0 references
    shadow
    0 references
    Macaulay theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references