Durfee Triangle in Ferrers Diagram Partitions

• The Durfee triangle is the largest right-angled isosceles staircase in a Ferrers diagram, defined by the condition λᵢ ≥ k−i+1 for 1 ≤ i ≤ k.
• It underpins combinatorial interpretations, equating its size with the maximum non-intersecting rook placements and yielding rational generating functions for partition counts.
• Its analysis produces exact recurrence relations, asymptotic formulas, and quasi-polynomial behaviors that distinguish it from Durfee squares and k-measure frameworks.

Searching arXiv for the cited papers to ground the article in current literature. arxiv_search.run({"query":"id:(Sharan, 27 Jul 2025) OR id:(Sharan et al., 25 Jul 2025) OR id:(Binner, 2022)","max_results":10}) In the theory of integer partitions, the Durfee triangle is the largest right-angled isosceles triangle contained in the Ferrers diagram of a partition, with the right angle or apex anchored at the top-left corner. For a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$, the Durfee triangle has size $k$ precisely when $\lambda_j\ge k-j+1$ for $1\le j\le k$, equivalently when the diagram contains the staircase subpartition with parts $1,2,\ldots,k$; its area is the triangular number $T_k=1+2+\cdots+k=\frac{k(k+1)}2$ (Sharan et al., 25 Jul 2025, Sharan, 27 Jul 2025). Recent work connects this statistic to rook placements on Ferrers boards, rational generating functions, fixed-length linear recurrences, quasi-polynomial formulas, modular periodicity, and asymptotic laws for partitions with prescribed triangle size (Sharan, 27 Jul 2025, Sharan et al., 25 Jul 2025).

1. Definition within Ferrers-diagram combinatorics

Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$ be a partition with $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$. Its Ferrers or Young diagram consists of $d$ left-aligned rows, with $\lambda_j$ boxes in row $k$0 (Sharan et al., 25 Jul 2025). In the coordinate convention used in the rook-theoretic treatment, the Ferrers diagram of $k$1 is the set of nodes at integer coordinates $k$2 with $k$3 and $k$4, and the associated Ferrers board $k$5 is obtained by replacing each node with a unit square (Sharan, 27 Jul 2025).

The classical Durfee square is the largest square contained in the Ferrers diagram and has size $k$6 when $k$7 for $k$8 (Sharan et al., 25 Jul 2025). The Durfee triangle is the corresponding staircase-shaped invariant: it is the largest top-left right-angled isosceles triangle whose horizontal and vertical sides have length $k$9 (Sharan et al., 25 Jul 2025). Equivalently, a partition has Durfee triangle size $\lambda_j\ge k-j+1$0 if and only if

$\lambda_j\ge k-j+1$1

A triangle of size $\lambda_j\ge k-j+1$2 contains $\lambda_j\ge k-j+1$3 nodes (Sharan et al., 25 Jul 2025, Sharan, 27 Jul 2025).

This definition is strictly different from the Durfee-square condition. The partition $\lambda_j\ge k-j+1$4 of $\lambda_j\ge k-j+1$5, for example, has Durfee square size $\lambda_j\ge k-j+1$6 and Durfee triangle size $\lambda_j\ge k-j+1$7 (Sharan, 27 Jul 2025). The triangle therefore measures a larger staircase core than the square in many diagrams.

2. Rook-theoretic interpretation

A central result of the 2025 literature is that the Durfee triangle admits an exact formulation in terms of non-intersecting rook placements on Ferrers boards. For a Ferrers board $\lambda_j\ge k-j+1$8, the rook number $\lambda_j\ge k-j+1$9 is the number of ways to place $1\le j\le k$0 pairwise non-intersecting rooks on $1\le j\le k$1, where non-intersecting means occupying distinct rows and distinct columns; the rook polynomial is

$1\le j\le k$2

(Sharan, 27 Jul 2025).

For a partition $1\le j\le k$3, the max-rook number $1\le j\le k$4 is defined as the maximal number of non-intersecting rooks that can be placed on $1\le j\le k$5 (Sharan, 27 Jul 2025). The structural theorem is that $1\le j\le k$6 equals the size of the Durfee triangle of $1\le j\le k$7 (Sharan, 27 Jul 2025, Sharan et al., 25 Jul 2025). In the formulation given in the rook-decomposition paper, a Ferrers board admits $1\le j\le k$8 non-intersecting rooks if and only if it contains the corresponding $1\le j\le k$9-step triangular staircase starting at the top-left corner; this is exactly the condition for a Durfee triangle of size $1,2,\ldots,k$0 (Sharan, 27 Jul 2025).

This equivalence reorganizes several counting problems. If $1,2,\ldots,k$1 denotes the number of partitions of $1,2,\ldots,k$2 whose Durfee triangle has size $1,2,\ldots,k$3, then the same quantity counts partitions whose Ferrers board has max-rook number $1,2,\ldots,k$4 (Sharan, 27 Jul 2025). Writing $1,2,\ldots,k$5 for the partition function, every partition has a unique Durfee triangle, hence

$1,2,\ldots,k$6

a decomposition termed the rook decomposition of $1,2,\ldots,k$7 (Sharan, 27 Jul 2025).

3. Rational generating functions and structural decomposition

For fixed $1,2,\ldots,k$8, the generating function

$1,2,\ldots,k$9

is rational (Sharan et al., 25 Jul 2025). The main formula is

$T_k=1+2+\cdots+k=\frac{k(k+1)}2$0

where $T_k=1+2+\cdots+k=\frac{k(k+1)}2$1 is a polynomial of degree $T_k=1+2+\cdots+k=\frac{k(k+1)}2$2 with

$T_k=1+2+\cdots+k=\frac{k(k+1)}2$3

and, when $T_k=1+2+\cdots+k=\frac{k(k+1)}2$4 is odd, $T_k=1+2+\cdots+k=\frac{k(k+1)}2$5, so the minimal denominator can be reduced to $T_k=1+2+\cdots+k=\frac{k(k+1)}2$6 (Sharan et al., 25 Jul 2025). This is the triangle analogue of the classical Durfee-square identity

$T_k=1+2+\cdots+k=\frac{k(k+1)}2$7

where $T_k=1+2+\cdots+k=\frac{k(k+1)}2$8 counts partitions of $T_k=1+2+\cdots+k=\frac{k(k+1)}2$9 with Durfee square size $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$0 (Sharan et al., 25 Jul 2025).

The rational form arises from a decomposition of the Ferrers diagram at the staircase core. After removing the Durfee triangle of size $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$1, one records horizontal excesses $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$2 in the first $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$3 rows and vertical excesses $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$4 in the first $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$5 columns, subject to the constraints

$\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$6

and

$\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$7

Introducing

$\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$8

one obtains the convolution

$\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_d)$9

Moreover,

$\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$0

where $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$1 has degree $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$2, leading coefficient $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$3, and $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$4 (Sharan et al., 25 Jul 2025). Clearing denominators with Gaussian binomial coefficients gives

$\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$5

The same rationality is visible concretely in the explicit formulas computed for small $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$6 in the rook-decomposition paper. For example,

$\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$7

$\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$8

and an explicit rational form is also given for $\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_d\ge1$9 (Sharan, 27 Jul 2025).

4. Exact formulas, recurrences, and quasi-polynomial behavior

Because $d$0 is rational, the sequence $d$1 is C-finite (Sharan et al., 25 Jul 2025). More precisely, if $d$2, then the recurrence order is $d$3 for odd $d$4 and $d$5 otherwise (Sharan et al., 25 Jul 2025). For $d$6, the recurrence extracted from the denominator is

$d$7

equivalently,

$d$8

(Sharan et al., 25 Jul 2025, Sharan, 27 Jul 2025). For $d$9, one has

$\lambda_j$0

and for $\lambda_j$1,

$\lambda_j$2

(Sharan, 27 Jul 2025).

For fixed $\lambda_j$3, $\lambda_j$4 is eventually a quasi-polynomial of degree $\lambda_j$5 and quasi-period $\lambda_j$6, valid for all $\lambda_j$7 (Sharan et al., 25 Jul 2025). The case $\lambda_j$8 reduces to quasi-period $\lambda_j$9, and for $k$00 the exact formula is

$k$01

An equivalent expression is

$k$02

(Sharan et al., 25 Jul 2025).

For $k$03, the rook-decomposition paper gives an exact formula for $k$04 and $k$05, $k$06:

$k$07

No exact closed formula for $k$08 is given there, although the generating function and parity properties are established (Sharan, 27 Jul 2025).

Small values illustrate the onset of these sequences. One has $k$09 and $k$10 for all $k$11; also $k$12, $k$13, $k$14, $k$15, and $k$16, $k$17, $k$18 (Sharan et al., 25 Jul 2025, Sharan, 27 Jul 2025).

5. Arithmetic and asymptotic properties

The exact formulas for small fixed triangle size yield strong congruence information. For $k$19 and any $k$20,

$k$21

so the period modulo $k$22 is $k$23 (Sharan, 27 Jul 2025). For $k$24 and any $k$25,

$k$26

so the period modulo $k$27 is $k$28 (Sharan, 27 Jul 2025). More generally, since $k$29 is eventually a quasi-polynomial, it is eventually periodic modulo any fixed modulus $k$30 (Sharan et al., 25 Jul 2025).

The parity results obtained from the generating functions are especially explicit. For $k$31,

$k$32

while for $k$33,

$k$34

and for $k$35,

$k$36

The same source remarks that for $k$37 and $k$38 odd, $k$39 is always odd, and for $k$40 and $k$41 even, $k$42 is always odd (Sharan, 27 Jul 2025).

Asymptotically, fixed triangle size leads to polynomial growth. The general theorem is

$k$43

as $k$44 for fixed $k$45 (Sharan et al., 25 Jul 2025). The previously derived cases agree with this formula:

$k$46

(Sharan, 27 Jul 2025). In comparison, for fixed $k$47, the Durfee-square count $k$48 has degree $k$49 rather than $k$50 (Sharan et al., 25 Jul 2025).

6. Relation to Durfee squares, $k$51-measures, and terminological boundaries

The Durfee triangle sits naturally beside the Durfee square but is not interchangeable with it. For Durfee squares, the generating function is especially simple:

$k$52

whereas for Durfee triangles the denominator is a single $k$53 and the numerator is a nontrivial polynomial $k$54 of degree $k$55 with $k$56 (Sharan et al., 25 Jul 2025). The square count therefore arises from two independent bounded partition structures, while the triangle count is governed by coupled “step at most $k$57” excess conditions after staircase removal (Sharan et al., 25 Jul 2025). This distinction explains why fixed-size Durfee triangles and fixed-size Durfee squares have different growth degrees and different recurrence orders.

A separate line of work on $k$58-measures of partitions provides an important contrast. The $k$59-measure of a partition is the length of the largest subsequence of parts whose consecutive differences are at least $k$60 (Binner, 2022). For $k$61, the number of partitions of $k$62 with $k$63-measure $k$64 equals the number with Durfee square of side $k$65, and the paper proves this bijectively (Binner, 2022). For general $k$66, however, the natural shape in that framework is not a triangle but a $k$67-Durfee polygon: if $k$68 is even or $k$69 is odd, this is an $k$70 rectangle; if $k$71 is odd and $k$72 is even, it is a two-step rectangle with $k$73 rows of width $k$74 and $k$75 rows of width $k$76 (Binner, 2022). In particular, for $k$77 that paper explicitly states that the associated shape is rectangular when $k$78 is odd and two-step rectangular when $k$79 is even, not triangular (Binner, 2022).

This distinction addresses a common misconception. The term Durfee triangle belongs to the 2025 staircase-based theory of partitions and Ferrers-board rook maxima (Sharan, 27 Jul 2025, Sharan et al., 25 Jul 2025). It is not the terminology used in the $k$80-measure literature, where the correct generalization is the $k$81-Durfee polygon (Binner, 2022). The two frameworks are related by their shared concern with top-left anchored substructures in Ferrers diagrams, but they are not equivalent shape theories.