The Setting
For a natural number , the staircase is the partition of .✦ Adding a horizontal strip to a partition is the step of the Pieri rule. The question is, for , how a partition of that does not dominate is reached by such steps from a partition of a smaller staircase size, or , and in how many steps.
Dominance and Horizontal Strips
A partition is identified with its Young diagram: are the lengths of its rows, with beyond the last row, and is its number of cells. The row prefix sum of a Young diagram , for , is the number of cells in its first rows: (1)✦
A Young diagram dominates a Young diagram , written , if for every .✦
For Young diagrams and , the skew diagram is a horizontal strip if and no two cells of outside lie in the same column.✦ A strip chain of length from a Young diagram to a Young diagram is a sequence of Young diagrams (2)✦ in which every is a horizontal strip.
The Claim
Theorem 1. Let , and let be a Young diagram with that is not dominated by . Then there is a Young diagram for which one of the following holds: (3)✦
In the paper, the result reads: for and not dominated by , either there is with a horizontal strip of size , or and there are with and , every a nonempty horizontal strip, of total size .
What Is Checked
The theorem is stated over Young diagrams and their sizes, the staircase with the staircase sizes and , the dominance order given by row prefix sums, horizontal strips, and strip chains.
The library proves that the row prefix sums of a staircase are, for , (4)✦ and that those of any Young diagram satisfy, for , (5)✦
For a Young diagram and , the strip removal is the Young diagram contained in whose row has length (6)✦
When is the length of the first row, the strip removal satisfies (7)✦
Given a Young diagram , a number and , there are and a Young diagram such that (8)✦
Under the hypotheses of the theorem, if moreover , then (9)✦