Inequalities for the number of monotonic functions of partial orders (Q1820178): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On log concavity for order-preserving maps of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial applications of the Aleksandrov-Fenchel inequalities / rank
 
Normal rank

Latest revision as of 18:57, 17 June 2024

scientific article
Language Label Description Also known as
English
Inequalities for the number of monotonic functions of partial orders
scientific article

    Statements

    Inequalities for the number of monotonic functions of partial orders (English)
    0 references
    1986
    0 references
    Let N(a,b) be the number of strict order preserving maps from a given partial order P to the first r natural numbers which take a particular element x of P to a and take y in P to b. It is shown here that in appropriate ranges of the parameters, this function must obey the inequalities: \[ N(r,u+v+w)N(r+s+t,u)\leq N(r+s,u+w)N(r+t,u+v) \] \[ and\quad N(r,u)N(r+s+t,u+v+w)\leq N(r+s,u+w)N(r+t,u+v), \] and so must the analogous function for not necessarily strict order preserving maps. These results include an inequality of Daykin, Daykin and Paterson, which is the analogue for strict and order preserving maps of a theorem of Stanley that holds for injections. It is shown that these new inequalities do not hold in general for injections. A number of further results of the same kind are also given.
    0 references
    number of strict order preserving maps
    0 references
    partial order
    0 references

    Identifiers