Order Preserving Maps and Linear Extensions of a Finite Poset
David E. Daykin, Jacqueline W. Daykin
Abstract
David E. Daykin, Jacqueline W. Daykin
Abstract
We study order preserving maps from a finite poset to the integers. When these maps are bijective they are called linear extensions. For both kinds we give many elementary properties and inequalities. A positive correlation inequality was proved by Graham, Yao and Yao. Then contributions were made by Graham, Kleitman, Shearer, Shepp and others. We obtain the corresponding negative correlation inequalities. Most authors have used the FKG inequality; we use an inequality of Daykin instead. Graham made a conjecture concerning range posets so we characterise these, and prove various cases of the conjecture. Finally we give necessary and sufficient conditions for a map defined on a subposet to extend to the whole poset. The results have applications in computer science.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We study order preserving maps from a finite poset to the integers. When these maps are bijective they are called linear extensions. For both kinds we give many elementary properties and inequalities. A positive correlation inequality was proved by Graham, Yao and Yao. Then contributions were made by Graham, Kleitman, Shearer, Shepp and others. We obtain the corresponding negative correlation inequalities. Most authors have used the FKG inequality; we use an inequality of Daykin instead. Graham made a conjecture concerning range posets so we characterise these, and prove various cases of the conjecture. Finally we give necessary and sufficient conditions for a map defined on a subposet to extend to the whole poset. The results have applications in computer science.
Key concepts: Partially ordered set, Bijection, Mathematics, Conjecture, Combinatorics, Order (exchange), Inequality, Discrete mathematics