normalized matching posets and chain partitions
TRANSCRIPT
![Page 1: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/1.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets and Chain Partitions
Shahriar Shahriari
Department of MathematicsPomona College
Claremont, CaliforniaUSA
Polish Combinatorial ConferenceBedlewo, PolandOctober 19, 2008
![Page 2: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/2.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)
A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 3: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/3.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.
i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 4: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/4.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 5: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/5.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.
µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 6: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/6.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.
i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 7: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/7.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 8: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/8.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Definition
P = finite partially ordered set (poset)A chain in P = a linearly ordered subset of P.i.e., a0, a1, . . ., an is a chain of size n + 1 (and length n) in P if
a0 < a1 < . . . < an.
Question
P a poset.µ = (µ1, µ2, . . . , µk) an integer partition of |P|.i.e., µ1 ≥ µ2 ≥ · · · ≥ µk positive integers with
µ1 + µ2 + · · ·+ µk = |P| .
Can we partition the poset P into k chains with sizes µ1, . . ., µk?
![Page 9: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/9.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
����
PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 10: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/10.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
����
PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 11: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/11.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1} {2}
{2} {3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
����
PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 12: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/12.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1} {2}
{2} {3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3} {2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
����
PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 13: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/13.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1} {2}
{2} {3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3} {2, 3}
{2, 3}
{1, 2, 3}{1, 2, 3}
����
����
����
����
PPPPPPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 14: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/14.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2} {3}
{3}
{1, 2}
{1, 2} {1, 3}
{1, 3} {2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
���� PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 15: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/15.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
���� PPPP
PPPP
PPPP
����
����
PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 16: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/16.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
���� PPPP
PPPP
PPPP
����
����
PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 17: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/17.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
���� PPPP
PPPP
PPPP
����
����
PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 18: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/18.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
Example (Boolean Lattice of order 3)
∅
∅
{1}
{1}
{2}
{2}
{3}
{3}
{1, 2}
{1, 2}
{1, 3}
{1, 3}
{2, 3}
{2, 3}
{1, 2, 3}
{1, 2, 3}
����
����
����
����
PPPP
PPPP
PPPP
����
���� PPPP
PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 19: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/19.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
The question is too general.
We want to consider a class of posets that is a generalizationof the Boolean Lattices.
To focus on the so-called “Normalized Matching” or LYMposets.
![Page 20: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/20.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
The question is too general.
We want to consider a class of posets that is a generalizationof the Boolean Lattices.
To focus on the so-called “Normalized Matching” or LYMposets.
![Page 21: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/21.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
Chain Partitions in Posets
The question is too general.
We want to consider a class of posets that is a generalizationof the Boolean Lattices.
To focus on the so-called “Normalized Matching” or LYMposets.
![Page 22: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/22.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.The set of elements of rank k in a graded poset P = the k-th levelof P.The size of the k-th level of P = the kth rank number of P.
![Page 23: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/23.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.
If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.The set of elements of rank k in a graded poset P = the k-th levelof P.The size of the k-th level of P = the kth rank number of P.
![Page 24: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/24.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .
In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.The set of elements of rank k in a graded poset P = the k-th levelof P.The size of the k-th level of P = the kth rank number of P.
![Page 25: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/25.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.
The set of elements of rank k in a graded poset P = the k-th levelof P.The size of the k-th level of P = the kth rank number of P.
![Page 26: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/26.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.The set of elements of rank k in a graded poset P = the k-th levelof P.
The size of the k-th level of P = the kth rank number of P.
![Page 27: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/27.jpg)
Chain Partitions of Normalized Matching Posets
Chains & Posets
rank & rank numbers in graded posets
Definition
P is a graded poset of rank n if all maximal chains in P havelength n.If P graded, then rank of x ∈ P is the length of any maximal chainfrom a minimal element of P to x .In a graded poset, each element has a well-defined rank, and theposet is partitioned into levels with each level consisting ofelements of the same rank.The set of elements of rank k in a graded poset P = the k-th levelof P.The size of the k-th level of P = the kth rank number of P.
![Page 28: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/28.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges.
For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y . i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |. Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 29: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/29.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges. For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y .
i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |. Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 30: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/30.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges. For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y . i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |. Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 31: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/31.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges. For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y . i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |.
Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 32: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/32.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges. For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y . i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |. Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 33: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/33.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Matchings and Marriage
Definition
Let G = (X ,E ,Y ) be a bipartite graph with X ∪ Y = the set ofvertices and E = the set of edges. For Z ⊆ X , define Γ(Z ) = theset of neighbors of X in Y . i.e.,
Γ(Z ) = {y ∈ Y | ∃ z ∈ Z such that (z , y) ∈ E}.
Theorem (Marriage Theorem)
Let G = (X ,E ,Y ) be a bipartite graph, with |X | ≤ |Y |. Anecessary and sufficient condition for the existence of a matchingfrom X to Y is:
|Γ(Z )| ≥ |Z | , ∀ Z ⊆ X .
![Page 34: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/34.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 35: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/35.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X .
Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 36: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/36.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 37: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/37.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X |
⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 38: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/38.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 39: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/39.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 40: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/40.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
The normalized matching condition
Question
Given a bipartite graph with parts X and Y , what is the maximumpossible constant α such that
|Γ(Z )| ≥ α |Z | , ∀ Z ⊆ X .
The inequality should work for Z = X . Assuming no isolatedpoints, we have Γ(X ) = Y , and so:
|Y | ≥ α |X | ⇒ α ≤ |Y | / |X | .
Thus the best we can hope for is:
|Γ(Z )||Y |
≥ |Z ||X |
∀Z ⊆ X .
![Page 41: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/41.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n.
P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 42: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/42.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM)
(or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 43: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/43.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property)
if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 44: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/44.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 45: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/45.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 46: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/46.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤
|Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 47: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/47.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 48: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/48.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.
Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 49: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/49.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn)
denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 50: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/50.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Definition
Definition (Graham & Harper 1969)
P a finite graded poset of rank n. P is normalized matching(NM) (or has the LYM property) if, for any consecutive levels Xand Y in P and Z ⊆ X , we have
|Z ||X |
≤ |Γ(Z )||Y |
,
where Γ(Z ) is the set of neighbors of Z in Y .
Notation
r0, r1, . . ., rn positive integers.Then NM(r0, . . . , rn) denotes theset of normalized matching posets with rank #s r0, . . ., rn.
![Page 51: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/51.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 52: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/52.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 53: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/53.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 54: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/54.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 55: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/55.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 56: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/56.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
i
i
Not normalized Matching
![Page 57: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/57.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Relation to matching
Remark
Let P ∈ NM(r0, r1).
If r0 = r1, then P is NM iff there is a perfect matchingbetween level 0 and level 1 of P.
If r0 < r1, then P NM is more than the existence of amatching from level 0 into level 1:
tt t
AA
AA
����
tt
����
ii
Not normalized Matching
![Page 58: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/58.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 59: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/59.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 60: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/60.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 61: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/61.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 62: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/62.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 63: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/63.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Workers and Tasks Metaphor
Reformulation
tt t
AA
AA
����
tt
AA
AA
����
workers
tasks
2 1 1 2
Normalized Matching
Assign each worker 3 (not nec. distinct) tasks such that each taskis assigned 2 (not nec. distinct) workers.
P is NM iff you can make such an assignment for each twoconsecutive levels.
![Page 64: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/64.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Examples
Theorem
Any regular poset (a poset where all the elements at a given levelhave the same up-degree, and all the elements at the same levelhave the same down-degree) is a normalized matching poset.
Corollary
The Subset Lattices, the Subspace Lattices, and the DivisorLattices are all normalized matching posets.
![Page 65: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/65.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Examples
Theorem
Any regular poset (a poset where all the elements at a given levelhave the same up-degree, and all the elements at the same levelhave the same down-degree) is a normalized matching poset.
Corollary
The Subset Lattices,
the Subspace Lattices, and the DivisorLattices are all normalized matching posets.
![Page 66: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/66.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Examples
Theorem
Any regular poset (a poset where all the elements at a given levelhave the same up-degree, and all the elements at the same levelhave the same down-degree) is a normalized matching poset.
Corollary
The Subset Lattices, the Subspace Lattices,
and the DivisorLattices are all normalized matching posets.
![Page 67: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/67.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Examples
Theorem
Any regular poset (a poset where all the elements at a given levelhave the same up-degree, and all the elements at the same levelhave the same down-degree) is a normalized matching poset.
Corollary
The Subset Lattices, the Subspace Lattices, and the DivisorLattices are all normalized matching posets.
![Page 68: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/68.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Examples
Theorem
Any regular poset (a poset where all the elements at a given levelhave the same up-degree, and all the elements at the same levelhave the same down-degree) is a normalized matching poset.
Corollary
The Subset Lattices, the Subspace Lattices, and the DivisorLattices are all normalized matching posets.
![Page 69: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/69.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a poset
An anti-chain in P is a set of pairwise incomparable elements.The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 70: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/70.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a posetAn anti-chain in P is a set of pairwise incomparable elements.
The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 71: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/71.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a posetAn anti-chain in P is a set of pairwise incomparable elements.The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 72: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/72.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a posetAn anti-chain in P is a set of pairwise incomparable elements.The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 73: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/73.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a posetAn anti-chain in P is a set of pairwise incomparable elements.The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 74: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/74.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
anti-chains and k-families
Definition
P a posetAn anti-chain in P is a set of pairwise incomparable elements.The width of P is the size of the largest anti-chain in P.A k-family in P is a subset of P that contains no chains of lengthk.
1-family = anti-chain.
In a graded poset, the union of any k levels is a k-family.
[Dilworth’s Theorem] The width of P is the minimumnumber of chains needed to cover P.
![Page 75: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/75.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn.
The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 76: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/76.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 77: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/77.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 78: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/78.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P,
let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 79: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/79.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i .
Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 80: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/80.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1
LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 81: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/81.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 82: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/82.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Equivalent Formulations
Theorem (Kleitman)
P a graded poset with rank numbers r0, . . ., rn. The Following AreEquivalent:
P ∈ NM(r0, . . . , rn).
For any anti-chain (a set of pair-wise incomparable elements)A ⊆ P, let ai = number of elements of A of rank i . Then
n∑i=0
ai
ri≤ 1 LYM inequality
P has a regular chain cover, i.e., can find a number of (notnecessarily disjoint) maximal chains that cover P and all theelements in the same level are on the same number of chains.
![Page 83: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/83.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 84: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/84.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,
i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 85: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/85.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 86: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/86.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property,
i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 87: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/87.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 88: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/88.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property,
i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 89: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/89.jpg)
Chain Partitions of Normalized Matching Posets
Normalized Matching Posets
Consequences of Normalized Matching
Theorem
If P has the normalized matching property, then
P has the strong matching property,i.e., for any levels L1, L2
of P with |L1| ≤ |L2|, ∃ a matching from L1 to a subset of L2.
P has the strong Sperner property, i.e., for any k ≥ 1, thesize of any k-family (a collection that contains no chains ofsize k + 1) is no greater than the sum of the sizes of the klargest levels of P.
P has the Stanley chain property, i.e., for any level L in P, ∃|L| disjoint chains in P such that each chain meets every levelof size at least |L|.
![Page 90: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/90.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 91: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/91.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset.
A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 92: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/92.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition
ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 93: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/93.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P
is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 94: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/94.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains
such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 95: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/95.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition,
the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 96: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/96.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 97: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/97.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested
if it has a nesting.
![Page 98: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/98.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Definition
Definition (Gansner 1982)
P a finite graded poset. A nested chain decomposition ornesting of P is a partition of P into chains such that for any twochains in the partition, the ranks of elements of one of the chainsis a subset of the ranks of the elements of the other.
P is nested if it has a nesting.
![Page 99: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/99.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t t��
��
��
��
��
PPPPPP t@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t t��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 100: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/100.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t t
��
��
��
��
��
PPPPPP t@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t t��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 101: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/101.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t
t
��
��
��
��
��
PPPPPP t
@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t t��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 102: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/102.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t
t
��
��
��
��
��
PPPPPP t@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t t��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 103: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/103.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t
t
��
��
��
��
��
PPPPPP t@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t t
��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 104: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/104.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
Example
Example
t t tt t t
t t t t��
��
��
��
��
��
@@
@@
@@
@@
@@
@@
PPPPPP
������
t t tt t t
t t t
t
��
��
��
��
��
PPPPPP t@@
@@
@@
@@
@@
@@
������
��
t t tt t t
t t t
t
��
��
��
��
��
�� t@
@@
@
@@
@@
@@
@@
PPPPPP
������
![Page 105: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/105.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 106: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/106.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 107: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/107.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique,
and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 108: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/108.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 109: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/109.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.
σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 110: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/110.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.
σ is called the NCD partition of |P|.
![Page 111: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/111.jpg)
Chain Partitions of Normalized Matching Posets
Nested Chain Decomposition
The NCD partition of |P|
A nested chain decomposition
may or may not exist.
may or may not be unique.
However, if a nested chain decomposition exists, then the numberof chains and the sizes of the chains in such a chain partition areunique, and only depend on the rank numbers of the poset.
Definition
P a finite graded poset of rank n.σ the partition of the integer |P| given by the sizes of thehypothetical nested chain decomposition of P.σ is called the NCD partition of |P|.
![Page 112: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/112.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.Then µ ≤ ν in the dominance (or majorization) order if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 113: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/113.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.
Then µ ≤ ν in the dominance (or majorization) order if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 114: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/114.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.Then µ ≤ ν in the dominance (or majorization) order
if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 115: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/115.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.Then µ ≤ ν in the dominance (or majorization) order if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 116: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/116.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.Then µ ≤ ν in the dominance (or majorization) order if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 117: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/117.jpg)
Chain Partitions of Normalized Matching Posets
Majorization or Dominance
Definition
µ = (µi ) and ν = (νi ) two partitions of a positive integer m.Then µ ≤ ν in the dominance (or majorization) order if and onlyif, for all j ,
j∑i=1
µi ≤j∑
i=1
νi .
Example
5, 5, 4, 3, 3, 3, 3, 2, 2, 2 < 6, 4, 4, 4, 4, 2, 2, 2, 2, 2
4, 3, 1, 1 and 5, 1, 1, 1, 1 are incomparable.
![Page 118: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/118.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 119: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/119.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,
σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 120: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/120.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,
µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 121: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/121.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.
A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 122: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/122.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists
if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 123: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/123.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 124: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/124.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Generalized Griggs Conjecture (SS)
P be a finite normalized matching poset,σ the NCD partition of |P|,µ = (µ1, . . . , µm) an arbitrary partition of |P|.A partition of the poset P into m chains with sizes µ1, . . . , µm
exists if and only if µ ≤ σ in the dominance order.
The only if direction is straightforward.
![Page 125: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/125.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
Example
∅
{1} {2} {3}
{1, 2} {1, 3} {2, 3}
{1, 2, 3}
����
���� PPPP
PPPP
����
���� PPPP
PPPP
18
2, 16
22, 14
23, 12
24
3, 22, 1
32, 12
32, 2
4, 22
4, 2, 12
4, 14
3, 2, 13
3, 15
HHH
HHH
��
��
��
![Page 126: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/126.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.
The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 127: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/127.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P
(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 128: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/128.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 129: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/129.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD,
the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 130: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/130.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 131: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/131.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes
(twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 132: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/132.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The Furedi Partition
The top partition is the NCD partition, the bottom partition isalways 1|P|.The number of chains in the NCD partition is the minimumnumber needed for a partition of P(size of the largest anti-chain ofP = the width of P).
Definition
Among the partitions dominated by NCD, the minimal partitionwith the minimum number of chains is called the Furedi partition.
The Furedi partition consists of only two chain sizes (twoconsecutive integers). It is an attempt to partition P into as fewchains as possible and with uniform size.
![Page 133: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/133.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 134: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/134.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 135: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/135.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 136: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/136.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 137: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/137.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 138: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/138.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 139: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/139.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 140: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/140.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
Special cases of the Generalized Griggs Conjecture are:
Conjecture (Griggs’ Nesting Conjecture 1975)
Every finite normalized matching poset is nested.
Conjecture (Furedi’s Question 1985)
The Boolean lattices can be partitioned into chains according tothe Furedi partition.
Conjecture (Sands 1985 for c = 4, Griggs 1988 for general c)
Fix c ≥ 1. For n sufficiently large, the Boolean Lattices can bepartitioned into chains of length c, except for at most c − 1elements, which also belong to a single chain.
Conjecture (Griggs’ Dominance Conjecture 1988)
The generalized Griggs conjecture is true for the Boolean Lattices.
![Page 141: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/141.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
33 year old Griggs Nesting Conjecture open even for rank 3posets.
Furedi’s Question is open for the Boolean Lattices.
Griggs Dominance conjecture is open for the BooleanLattices.
![Page 142: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/142.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
33 year old Griggs Nesting Conjecture open even for rank 3posets.
Furedi’s Question is open for the Boolean Lattices.
Griggs Dominance conjecture is open for the BooleanLattices.
![Page 143: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/143.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
33 year old Griggs Nesting Conjecture open even for rank 3posets.
Furedi’s Question is open for the Boolean Lattices.
Griggs Dominance conjecture is open for the BooleanLattices.
![Page 144: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/144.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
On Sands and Griggs’ Conjecture:
Problem (Sands, 1985)
Can 2[n] be partitioned into chains of size 4 for sufficiently large n?Given k, can 2[n] be partitioned into chains of size 2k , for n largeenough?
For k = 0, 1, the problem is easy. For k = 1, just take the chainsX ,X ∪ {n} for all X ⊆ [n − 1].
Theorem (Griggs, Grinstead, Yeh, 1987)
2[n] can be partitioned into chains of size 4 if and only if n ≥ 9.
![Page 145: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/145.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
On Sands and Griggs’ Conjecture:
Problem (Sands, 1985)
Can 2[n] be partitioned into chains of size 4 for sufficiently large n?Given k, can 2[n] be partitioned into chains of size 2k , for n largeenough?
For k = 0, 1, the problem is easy. For k = 1, just take the chainsX ,X ∪ {n} for all X ⊆ [n − 1].
Theorem (Griggs, Grinstead, Yeh, 1987)
2[n] can be partitioned into chains of size 4 if and only if n ≥ 9.
![Page 146: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/146.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
On Sands and Griggs’ Conjecture:
Problem (Sands, 1985)
Can 2[n] be partitioned into chains of size 4 for sufficiently large n?Given k, can 2[n] be partitioned into chains of size 2k , for n largeenough?
For k = 0, 1, the problem is easy. For k = 1, just take the chainsX ,X ∪ {n} for all X ⊆ [n − 1].
Theorem (Griggs, Grinstead, Yeh, 1987)
2[n] can be partitioned into chains of size 4 if and only if n ≥ 9.
![Page 147: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/147.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
Conjecture (Griggs’ c-conjecture 1988)
Fix c ≥ 1. For n sufficiently large, 2[n] can be partitioned intochains of length c, except for at most c − 1 elements, which alsobelong to a single chain.
Theorem (Lonc 1991)
The Griggs’ c-conjecture is true.
For a given c , Lonc’s proof needs n to be very large. Elzobi &Lonc: for n sufficiently large, 2[n] can be partitioned into chains ofsize c = b1
6
√log log nc, except possibly c − 1 elements which also
form a chain.According to the Griggs’ dominating conjecture, we should be ableto partition 2[n] as above for c an appropriate constant multiple of√
n.
![Page 148: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/148.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
Conjecture (Griggs’ c-conjecture 1988)
Fix c ≥ 1. For n sufficiently large, 2[n] can be partitioned intochains of length c, except for at most c − 1 elements, which alsobelong to a single chain.
Theorem (Lonc 1991)
The Griggs’ c-conjecture is true.
For a given c , Lonc’s proof needs n to be very large. Elzobi &Lonc: for n sufficiently large, 2[n] can be partitioned into chains ofsize c = b1
6
√log log nc, except possibly c − 1 elements which also
form a chain.According to the Griggs’ dominating conjecture, we should be ableto partition 2[n] as above for c an appropriate constant multiple of√
n.
![Page 149: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/149.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
Conjecture (Griggs’ c-conjecture 1988)
Fix c ≥ 1. For n sufficiently large, 2[n] can be partitioned intochains of length c, except for at most c − 1 elements, which alsobelong to a single chain.
Theorem (Lonc 1991)
The Griggs’ c-conjecture is true.
For a given c , Lonc’s proof needs n to be very large. Elzobi &Lonc: for n sufficiently large, 2[n] can be partitioned into chains ofsize c = b1
6
√log log nc, except possibly c − 1 elements which also
form a chain.
According to the Griggs’ dominating conjecture, we should be ableto partition 2[n] as above for c an appropriate constant multiple of√
n.
![Page 150: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/150.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Sands and Griggs Conjecture
Conjecture (Griggs’ c-conjecture 1988)
Fix c ≥ 1. For n sufficiently large, 2[n] can be partitioned intochains of length c, except for at most c − 1 elements, which alsobelong to a single chain.
Theorem (Lonc 1991)
The Griggs’ c-conjecture is true.
For a given c , Lonc’s proof needs n to be very large. Elzobi &Lonc: for n sufficiently large, 2[n] can be partitioned into chains ofsize c = b1
6
√log log nc, except possibly c − 1 elements which also
form a chain.According to the Griggs’ dominating conjecture, we should be ableto partition 2[n] as above for c an appropriate constant multiple of√
n.
![Page 151: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/151.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
On Furedi’s Question:
In the (hypothetical) Furedi partition of 2[n], the number of chainsis
( nbn/2c
), and the sizes of the chains are a(n) and a(n) + 1, where
a(n) = b2n/( nb n
2c)c ∼
√π/2
√n.
Theorem (Hsu, Logan, SS., Towse 02 & 03)
2[n] has a partition into( nbn/2c
)chains such that the size of the
shortest chains are at least 12
√n, and, for n > 16, the size of the
longest chains is at most 32
√n log n.
![Page 152: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/152.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
On Furedi’s Question:
In the (hypothetical) Furedi partition of 2[n], the number of chainsis
( nbn/2c
), and the sizes of the chains are a(n) and a(n) + 1, where
a(n) = b2n/( nb n
2c)c ∼
√π/2
√n.
Theorem (Hsu, Logan, SS., Towse 02 & 03)
2[n] has a partition into( nbn/2c
)chains such that the size of the
shortest chains are at least 12
√n, and, for n > 16, the size of the
longest chains is at most 32
√n log n.
![Page 153: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/153.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
On Furedi’s Question:
In the (hypothetical) Furedi partition of 2[n], the number of chainsis
( nbn/2c
), and the sizes of the chains are a(n) and a(n) + 1, where
a(n) = b2n/( nb n
2c)c ∼
√π/2
√n.
Theorem (Hsu, Logan, SS., Towse 02 & 03)
2[n] has a partition into( nbn/2c
)chains
such that the size of the
shortest chains are at least 12
√n, and, for n > 16, the size of the
longest chains is at most 32
√n log n.
![Page 154: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/154.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
On Furedi’s Question:
In the (hypothetical) Furedi partition of 2[n], the number of chainsis
( nbn/2c
), and the sizes of the chains are a(n) and a(n) + 1, where
a(n) = b2n/( nb n
2c)c ∼
√π/2
√n.
Theorem (Hsu, Logan, SS., Towse 02 & 03)
2[n] has a partition into( nbn/2c
)chains such that the size of the
shortest chains are at least 12
√n,
and, for n > 16, the size of thelongest chains is at most 3
2
√n log n.
![Page 155: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/155.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
On Furedi’s Question:
In the (hypothetical) Furedi partition of 2[n], the number of chainsis
( nbn/2c
), and the sizes of the chains are a(n) and a(n) + 1, where
a(n) = b2n/( nb n
2c)c ∼
√π/2
√n.
Theorem (Hsu, Logan, SS., Towse 02 & 03)
2[n] has a partition into( nbn/2c
)chains such that the size of the
shortest chains are at least 12
√n, and, for n > 16, the size of the
longest chains is at most 32
√n log n.
![Page 156: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/156.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet.
The Generalized Furedi conjecture is true if
P is of rank 2, or
P has rapidly decreasing rank numbers, i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size., or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 157: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/157.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet. The Generalized Furedi conjecture is true if
P is of rank 2, or
P has rapidly decreasing rank numbers, i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size., or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 158: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/158.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet. The Generalized Furedi conjecture is true if
P is of rank 2,
or
P has rapidly decreasing rank numbers, i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size., or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 159: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/159.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet. The Generalized Furedi conjecture is true if
P is of rank 2, or
P has rapidly decreasing rank numbers,
i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size., or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 160: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/160.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet. The Generalized Furedi conjecture is true if
P is of rank 2, or
P has rapidly decreasing rank numbers, i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size.,
or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 161: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/161.jpg)
Chain Partitions of Normalized Matching Posets
Special Cases: Griggs Nesting Conjecture, Furedi’s Conjecture, Griggs Dominance Conjecture
On Furedi’s Question
Theorem (Hsu, Logan, S. 06)
Let P be a rank-unimodal, rank-symmetric normalized matchingposet. The Generalized Furedi conjecture is true if
P is of rank 2, or
P has rapidly decreasing rank numbers, i.e., if the ratiobetween consecutive rank sizes is at least 2 when they are notboth equal to the maximum possible rank size., or
Corollary (Hsu, Logan, SS 06)
Let P be the poset of subspaces of a finite dimensional vectorspace over a finite field ordered by inclusion. Then there exists apartition of P into chains whose sizes are given by the Furedipartition.
![Page 162: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/162.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The full generalized Griggs Conjecture is known only for two cases:
Theorem (Lonc, Elzobi 99)
The generalized Griggs Conjecture is true for the product of twochains.
Theorem (Pearsall, SS)
The generalized Griggs Conjecture is true for all normalizedmatching posets of rank 2.
![Page 163: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/163.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The full generalized Griggs Conjecture is known only for two cases:
Theorem (Lonc, Elzobi 99)
The generalized Griggs Conjecture is true for the product of twochains.
Theorem (Pearsall, SS)
The generalized Griggs Conjecture is true for all normalizedmatching posets of rank 2.
![Page 164: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/164.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The full generalized Griggs Conjecture is known only for two cases:
Theorem (Lonc, Elzobi 99)
The generalized Griggs Conjecture is true for the product of twochains.
Theorem (Pearsall, SS)
The generalized Griggs Conjecture is true for all normalizedmatching posets of rank 2.
![Page 165: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/165.jpg)
Chain Partitions of Normalized Matching Posets
Generalized Griggs Conjecture
The full generalized Griggs Conjecture is known only for two cases:
Theorem (Lonc, Elzobi 99)
The generalized Griggs Conjecture is true for the product of twochains.
Theorem (Pearsall, SS)
The generalized Griggs Conjecture is true for all normalizedmatching posets of rank 2.
![Page 166: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/166.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 167: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/167.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal
if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 168: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/168.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 169: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/169.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if
, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 170: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/170.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .
P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 171: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/171.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.
If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 172: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/172.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.
If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 173: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/173.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 174: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/174.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.
Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 175: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/175.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Rank-Unimodal and Rank-Symmetric Posets
On Griggs’ Nesting Conjecture:
Definition
Let r0, r1, . . ., rn be a sequence of positive integers.This sequence is unimodal if there is an index 0 ≤ k ≤ n such that
r0 ≤ r1 ≤ · · · ≤ rk and rk ≥ rk+1 ≥ · · · ≥ rn.
The sequence is symmetric if, for 0 ≤ k ≤ n, rk = rn−k .P a graded poset with rank numbers r0, . . ., rn.If r0, . . . , rn is unimodal then P is called rank-unimodal.If r0, . . . , rn is symmetric then P is called rank-symmetric.
Remark
P rank-unimodal, rank-symmetric finite graded poset.Then a Nested Chain Decomposition for P is called a SymmetricChain Decomposition.
![Page 176: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/176.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Anderson-Griggs Theorem
Theorem (Anderson 1967, Griggs 1977)
Let r0, r1, . . ., rn be a symmetric and unimodal sequence ofpositive integers.
Then every P ∈ NM(r0, . . . , rn) is nested.i.e., every rank-unimodal, rank-symmetric, normalized matchingposet has a symmetric chain decomposition.
![Page 177: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/177.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Anderson-Griggs Theorem
Theorem (Anderson 1967, Griggs 1977)
Let r0, r1, . . ., rn be a symmetric and unimodal sequence ofpositive integers. Then every P ∈ NM(r0, . . . , rn) is nested.
i.e., every rank-unimodal, rank-symmetric, normalized matchingposet has a symmetric chain decomposition.
![Page 178: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/178.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
Anderson-Griggs Theorem
Theorem (Anderson 1967, Griggs 1977)
Let r0, r1, . . ., rn be a symmetric and unimodal sequence ofpositive integers. Then every P ∈ NM(r0, . . . , rn) is nested.i.e., every rank-unimodal, rank-symmetric, normalized matchingposet has a symmetric chain decomposition.
![Page 179: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/179.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:
Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 180: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/180.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.
Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 181: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/181.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 182: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/182.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 183: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/183.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 184: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/184.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture
k-saturated partitions
Definition
If a partition of a poset P into chains has the following property:Choose K a maximum size k-family. Then every element in P\K isin a chain that intersects K in exactly k elements.Then this partition is called a k-saturated partition of P.
Theorem
1 If P is NM of rank n, then P is nested if and only if P has achain partition that is k-saturated for all k with 1 ≤ k ≤ n.
2 [Greene & Kleitman 1976] For every positive integer k, everyposet P has a chain partition that is simultaneously k andk + 1 saturated.
Corollary
Every rank 2 normalized matching poset is nested.
![Page 185: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/185.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Standard case
On Griggs’ Nesting Conjecture for rank 3 posets:
Standard case
To prove Griggs Nesting conjecture for rank 3 posets it is enoughto prove that every P ∈ NM(r0, r1, r2, r3) is nested where r0, r1,r2, and r3 are arbitrary positive integers with
r0 = r3 < r1 ≤ r2.
R0
R1
R2
R3
![Page 186: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/186.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Standard case
On Griggs’ Nesting Conjecture for rank 3 posets:
Standard case
To prove Griggs Nesting conjecture for rank 3 posets it is enoughto prove that every P ∈ NM(r0, r1, r2, r3) is nested where r0, r1,r2, and r3 are arbitrary positive integers with
r0 = r3 < r1 ≤ r2.
R0
R1
R2
R3
![Page 187: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/187.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Standard case
On Griggs’ Nesting Conjecture for rank 3 posets:
Standard case
To prove Griggs Nesting conjecture for rank 3 posets it is enoughto prove that every P ∈ NM(r0, r1, r2, r3) is nested where r0, r1,r2, and r3 are arbitrary positive integers with
r0 = r3 < r1 ≤ r2.
R0
R1
R2
R3
![Page 188: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/188.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
NM(5, 16, r, 5)
Consider P ∈ NM(5, 16, r , 5) with r ≥ 16.
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
A nested chain decomposition of P would consist of five chains ofsize 4, 11 chains of size 2, and r − 16 singletons. How hard can itbe?
![Page 189: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/189.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
NM(5, 16, r, 5)
Consider P ∈ NM(5, 16, r , 5) with r ≥ 16.
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
A nested chain decomposition of P would consist of five chains ofsize 4, 11 chains of size 2, and r − 16 singletons. How hard can itbe?
![Page 190: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/190.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
NM(5, 16, r, 5)
Consider P ∈ NM(5, 16, r , 5) with r ≥ 16.
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
A nested chain decomposition of P would consist of five chains ofsize 4, 11 chains of size 2, and r − 16 singletons.
How hard can itbe?
![Page 191: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/191.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
NM(5, 16, r, 5)
Consider P ∈ NM(5, 16, r , 5) with r ≥ 16.
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
A nested chain decomposition of P would consist of five chains ofsize 4, 11 chains of size 2, and r − 16 singletons. How hard can itbe?
![Page 192: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/192.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 193: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/193.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 194: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/194.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 195: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/195.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 196: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/196.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 197: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/197.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Anderson-Griggs Theorem
Before our work the only case (from among NM(5, 16, r , 5)) donewas the case r = 16.
Theorem (Anderson 1967, Griggs 1977)
Every rank-unimodal, rank-symmetric, normalized matching posethas a symmetric chain decomposition.
Idea of Proof.
![Page 198: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/198.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy
and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 199: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/199.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 200: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/200.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 201: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/201.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 202: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/202.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 203: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/203.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing chains from the middle
Question
When can we use the Anderson-Griggs strategy and extend anymatching of the middle two levels to a nesting?
For NM(5, 16, r , 5), we showed that we can do so also forr = 17, 18, and 19.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), any matching of level 1 intolevel 2 can be extended to a nesting of P.
2
r2 − r1 ≤ d r2r0e − 1.
![Page 204: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/204.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
For NM(5, 16, r , 5), the above nesting method does not work forr ≥ 20.
But for r = 20 and 21, we have an alternative.The deep theorem of Greene and Kleitman produces, in the case ofP ∈ NM(5, 16, r , 5), a chain partition of P consisting of r chainssuch that each of the 10 elements of rank 0 and 3 are on chainsthat also have elements of rank 1 and 2. For example:
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
We have shown that for r = 20 and 21, the matching between themiddle two levels, given by this partition, can be extended outwardto get a nesting!
![Page 205: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/205.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
For NM(5, 16, r , 5), the above nesting method does not work forr ≥ 20. But for r = 20 and 21, we have an alternative.
The deep theorem of Greene and Kleitman produces, in the case ofP ∈ NM(5, 16, r , 5), a chain partition of P consisting of r chainssuch that each of the 10 elements of rank 0 and 3 are on chainsthat also have elements of rank 1 and 2. For example:
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
We have shown that for r = 20 and 21, the matching between themiddle two levels, given by this partition, can be extended outwardto get a nesting!
![Page 206: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/206.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
For NM(5, 16, r , 5), the above nesting method does not work forr ≥ 20. But for r = 20 and 21, we have an alternative.The deep theorem of Greene and Kleitman produces, in the case ofP ∈ NM(5, 16, r , 5), a chain partition of P consisting of r chains
such that each of the 10 elements of rank 0 and 3 are on chainsthat also have elements of rank 1 and 2. For example:
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
We have shown that for r = 20 and 21, the matching between themiddle two levels, given by this partition, can be extended outwardto get a nesting!
![Page 207: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/207.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
For NM(5, 16, r , 5), the above nesting method does not work forr ≥ 20. But for r = 20 and 21, we have an alternative.The deep theorem of Greene and Kleitman produces, in the case ofP ∈ NM(5, 16, r , 5), a chain partition of P consisting of r chainssuch that each of the 10 elements of rank 0 and 3 are on chainsthat also have elements of rank 1 and 2. For example:
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
We have shown that for r = 20 and 21, the matching between themiddle two levels, given by this partition, can be extended outwardto get a nesting!
![Page 208: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/208.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
For NM(5, 16, r , 5), the above nesting method does not work forr ≥ 20. But for r = 20 and 21, we have an alternative.The deep theorem of Greene and Kleitman produces, in the case ofP ∈ NM(5, 16, r , 5), a chain partition of P consisting of r chainssuch that each of the 10 elements of rank 0 and 3 are on chainsthat also have elements of rank 1 and 2. For example:
s s s s ss s s s s s s s s s s s s s s ss s s s s s s s s s s s s s s s s s ss s s s s. . .
5
16
r
5
We have shown that for r = 20 and 21, the matching between themiddle two levels, given by this partition, can be extended outwardto get a nesting!
![Page 209: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/209.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 210: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/210.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.
For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 211: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/211.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 212: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/212.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 213: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/213.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.
If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 214: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/214.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 215: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/215.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers.
Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 216: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/216.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Growing good chains from the middle
Theorem (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.For 0 ≤ i ≤ r1 − r0 − 1, define
f (i) =
⌈r0(1 + i)
r2 − r0
⌉−
⌊r0i
r1 − r0
⌋.
Let i0 be the largest integer (with 0 ≤ i0 ≤ r1 − r0 − 1) such thatf (i0) 6= 0.If f (i0) > 0, then every P ∈ NM(r0, r1, r2, r3) is nested.
Corollary (Escamilla, Nicolae, Salerno, SS, Tirrell)
Let r0 = r3 < r1 < r2 ≤ 11 be positive integers. Then everyP ∈ NM(r0, r1, r2, r3) is nested.
![Page 217: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/217.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3,
and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 218: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/218.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3, and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 219: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/219.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3, and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 220: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/220.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3, and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 221: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/221.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3, and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 222: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/222.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with long chains
Question
For an arbitrary poset P ∈ NM(5, 16, r , 5), can we start with anarbitrary set of 5 long chains from level 0 to level 3, and then findadditional 11 chains from level 1 to level 2 to get a nesting?
We showed that for r ≥ 91, the answer is yes.
Theorem (Hsu, Logan, SS 08)
Let r0 = r3 < r1 < r2 be positive integers. Then the following areequivalent.
1 For any P ∈ NM(r0, r1, r2, r3), every collection of r0 chainsof size 4 from level 0 to level 3 can be completed to a nesting.
2
r0r1 < r2.
![Page 223: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/223.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
The last result was improved by Jordan Tirrell who showed thatstarting with a particularly good set of long chains allows you tofind a nesting for r ≥ 74.
Theorem (Tirrell)
Let r0 = r3 < r1 < r2 be positive integers. Assumer2 > r0r1 − r0 gcd(r1, r2), Then every P ∈ NM(r0, r1, r2, r3) isnested.
![Page 224: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/224.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
The last result was improved by Jordan Tirrell who showed thatstarting with a particularly good set of long chains allows you tofind a nesting for r ≥ 74.
Theorem (Tirrell)
Let r0 = r3 < r1 < r2 be positive integers.
Assumer2 > r0r1 − r0 gcd(r1, r2), Then every P ∈ NM(r0, r1, r2, r3) isnested.
![Page 225: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/225.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
The last result was improved by Jordan Tirrell who showed thatstarting with a particularly good set of long chains allows you tofind a nesting for r ≥ 74.
Theorem (Tirrell)
Let r0 = r3 < r1 < r2 be positive integers. Assumer2 > r0r1 − r0 gcd(r1, r2), Then every P ∈ NM(r0, r1, r2, r3) isnested.
![Page 226: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/226.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74.
What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 227: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/227.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?
We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 228: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/228.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 229: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/229.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers.
Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 230: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/230.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 231: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/231.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,
2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 232: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/232.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,
3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 233: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/233.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 234: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/234.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Starting with good long chains
So, for P ∈ NM(5, 16, r , 5), we are guaranteed a nesting if r ≤ 21or r ≥ 74. What about any other cases?We can also produce nestings for r = 32, 48, 64, and 72! In fact,
Theorem
Let r0 = r3 < r1 < r2 be positive integers. Assume one of thefollowing holds
1 [Hsu, Logan, SS 08] r1 | r2,2 [Escamilla, Nicolae, Salerno, SS, Tirrell] r0 | r1,3 [Escamilla, Nicolae, Salerno, SS, Tirrell] (r0 + 1) | r1,
Then every P ∈ NM(r0, r1, r2, r3) is nested.
![Page 235: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/235.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Example
Example
Consider P ∈ NM(5, r1, r2, 5).
If r1 = 15, then P is nested for all r2 ≥ 15.If r1 = 16, then P is nested if
16 ≤ r2 ≤ 21, r2 = 32, 48, 64, 72, or r2 ≥ 74.
If r1 = 17, then P is nested if
17 ≤ r2 ≤ 23, r2 = 34, 51, 68, or r2 ≥ 81.
If r1 = 18, then P is nested for all r2 ≥ 18.
![Page 236: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/236.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Example
Example
Consider P ∈ NM(5, r1, r2, 5).If r1 = 15, then P is nested for all r2 ≥ 15.
If r1 = 16, then P is nested if
16 ≤ r2 ≤ 21, r2 = 32, 48, 64, 72, or r2 ≥ 74.
If r1 = 17, then P is nested if
17 ≤ r2 ≤ 23, r2 = 34, 51, 68, or r2 ≥ 81.
If r1 = 18, then P is nested for all r2 ≥ 18.
![Page 237: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/237.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Example
Example
Consider P ∈ NM(5, r1, r2, 5).If r1 = 15, then P is nested for all r2 ≥ 15.If r1 = 16, then P is nested if
16 ≤ r2 ≤ 21, r2 = 32, 48, 64, 72, or r2 ≥ 74.
If r1 = 17, then P is nested if
17 ≤ r2 ≤ 23, r2 = 34, 51, 68, or r2 ≥ 81.
If r1 = 18, then P is nested for all r2 ≥ 18.
![Page 238: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/238.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Example
Example
Consider P ∈ NM(5, r1, r2, 5).If r1 = 15, then P is nested for all r2 ≥ 15.If r1 = 16, then P is nested if
16 ≤ r2 ≤ 21, r2 = 32, 48, 64, 72, or r2 ≥ 74.
If r1 = 17, then P is nested if
17 ≤ r2 ≤ 23, r2 = 34, 51, 68, or r2 ≥ 81.
If r1 = 18, then P is nested for all r2 ≥ 18.
![Page 239: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/239.jpg)
Chain Partitions of Normalized Matching Posets
Griggs’ Nesting Conjecture—rank 3 posets
Example
Example
Consider P ∈ NM(5, r1, r2, 5).If r1 = 15, then P is nested for all r2 ≥ 15.If r1 = 16, then P is nested if
16 ≤ r2 ≤ 21, r2 = 32, 48, 64, 72, or r2 ≥ 74.
If r1 = 17, then P is nested if
17 ≤ r2 ≤ 23, r2 = 34, 51, 68, or r2 ≥ 81.
If r1 = 18, then P is nested for all r2 ≥ 18.
![Page 240: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/240.jpg)
Chain Partitions of Normalized Matching Posets
References
A. Pearsall and S. Shahriari. Chain decompositions of normalizedmatching posets of rank 2. Submitted.
E. Escamilla, A. Nicolae, P. Salerno, S. Shahriari, and J. Tirrell. Onnested chain decompositions of normalized matching posets of rank3. Submitted.
T. Hsu, M. Logan, and S. Shahriari. Methods for nesting rank 3normalized matching rank-unimodal posets. To appear in DiscreteMath..
T. Hsu, M. Logan, and S. Shahriari. The generalized Furediconjecture holds for finite linear lattices. Discrete Math.,306(23):3140–3144, 2006.
T. Hsu, M. Logan, S. Shahriari, and C. Towse. Partitioning theBoolean lattice into a minimal number of chains of relatively uniformsize. European Journal of Combinatorics, 24:219–228, 2003.
T. Hsu, M. Logan, S. Shahriari, and C. Towse. Partitioning the
Boolean lattice into chains of large minimum size. Journal of
Combinatorial Theory A, 97(1):62–84, 2002.
![Page 241: Normalized Matching Posets and Chain Partitions](https://reader031.vdocuments.net/reader031/viewer/2022020705/61fb88e52e268c58cd5f5120/html5/thumbnails/241.jpg)
Chain Partitions of Normalized Matching Posets
References
The End