Durfee square¶

The largest square contained in the Ferrers or Young diagram of an integer partition.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4282
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Partition Theory → Mathematics

Core Idea¶

Size means side length rather than area, English and French diagram conventions rotate the picture but preserve size and the statistic differs from partition rank in Dyson’s sense despite sometimes being called rank historically. The partition’s row lengths are compared with row indices; the greatest s with lambda_s at least s determines an s-by-s diagonal square, leaving partitions to its right and below. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Biggest Corner Square

Take some blocks and line them up in rows, with the longest row on top and each row below no longer than the one above. Look at the top-left corner. The biggest square of blocks that fits there completely filled in is the Durfee Square. We say how big it is by how many blocks long one side is.

Biggest Corner Square of Dots

A partition splits a number into smaller numbers, like 10 = 4 + 3 + 2 + 1, listed from biggest to smallest. You can draw it as rows of dots: 4 dots, then 3, then 2, then 1, all lined up on the left. The Durfee Square is the biggest square of dots that fits in the top-left corner. Its size is the length of its side, not how many dots it holds. Here it's 2, because row 2 has at least 2 dots but row 3 has fewer than 3. The leftover dots to the right and below make two smaller partitions.

Largest Diagonal Square of a Partition

For an integer partition λ with parts in nonincreasing order, draw its Ferrers or Young diagram. The Durfee Square has side s, where s is the largest integer with λ_s ≥ s; equivalently, it is the largest square that fits in the corner along the diagonal. Its 'size' means the side length s, not the area s². Whether you draw diagrams English style or French style just rotates the picture without changing s. Removing the square leaves two smaller partitions, one to the right (the arm) and one below (the leg), which is useful for generating functions. Don't confuse it with Dyson's rank of a partition, a different statistic, even though the Durfee size was sometimes historically called 'rank.'

For an integer partition λ = (λ_1 ≥ λ_2 ≥ …), the Durfee square is the largest s-by-s square of cells that fits in the corner of its Ferrers or Young diagram. Equivalently, s is the largest integer satisfying λ_s ≥ s, which is the number of diagonal cells. Its size is conventionally the side length s rather than the area. English and French diagram conventions reorient the diagram but leave s unchanged. Removing the square leaves two remainder partitions, one to the right (the arm) and one below (the leg). Together with s these form the Durfee symbol. This decomposition underlies generating-function identities that sum over s. The Durfee square should be distinguished from the Durfee rectangle generalization and from Dyson's rank, which is largest part minus number of parts, even though 'rank' was sometimes used historically for the Durfee size.

Scope of Application¶

Durfee square belongs to partition theory and is useful where the analyst can specify the typed partition theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the integer partition lambda in nonincreasing parts, Ferrers or Young diagram convention, diagonal cells, largest integer s satisfying lambda_s at least s, square of side s, arm and leg remainder partitions, Durfee symbol, generating-function decomposition and distinctions from Durfee rectangle and Dyson rank are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the integer partition lambda in nonincreasing parts, Ferrers or Young diagram convention, diagonal cells, largest integer s satisfying lambda_s at least s, square of side s, arm and leg remainder partitions, Durfee symbol, generating-function decomposition and distinctions from Durfee rectangle and Dyson rank are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Durfee square. Durfee square compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed partition theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the integer partition lambda in nonincreasing parts, Ferrers or Young diagram convention, diagonal cells, largest integer s satisfying lambda_s at least s, square of side s, arm and leg remainder partitions, Durfee symbol, generating-function decomposition and distinctions from Durfee rectangle and Dyson rank are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of partition theory because they reuse the typed partition theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, The partition’s row lengths are compared with row indices; the greatest s with lambda_s at least s determines an s-by-s diagonal square, leaving partitions to its right and below., and type the carrier, state every parameter and convention in the definition, test that the integer partition lambda in nonincreasing parts, Ferrers or Young diagram convention, diagonal cells, largest integer s satisfying lambda_s at least s, square of side s, arm and leg remainder partitions, Durfee symbol, generating-function decomposition and distinctions from Durfee rectangle and Dyson rank are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Durfee square Domain-specific

Parents (1) — outgoing typed relations

Durfee square is a kind of Decomposition Prime

It remains its own entry because its identity is fixed by the integer partition lambda in nonincreasing parts, Ferrers or Young diagram convention, diagonal cells, largest integer s satisfying lambda_s at least s, square of side s, arm and leg remainder partitions, Durfee symbol, generating-function decomposition and distinctions from Durfee rectangle and Dyson rank.

Hierarchy path (1) — routes to 1 parentless root

Durfee square → is a kind of Decomposition

Neighborhood in Abstraction Space¶

Durfee square sits in a crowded region of the domain-specific corpus (21^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Combinatorial Enumeration & Sequences (38 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25