A Geometric Characterization of Maximal Unrefinable Partitions via the Keith-Nath Transformation and Young Diagrams

We investigate the combinatorial structure of unrefinable partitions through their correspondence with numerical sets and Young diagrams. Building on the bijection introduced by Keith and Nath, we apply a general geometric criterion that links the unrefinability of a partition directly to the hook lengths of its associated Young diagram. This criterion provides a structural method for the characterization of any unrefinable partition. Using this general framework, we revisit the correspondence results between maximal unrefinable partitions and partitions into distinct parts, previously established using enumerative methods. We provide alternative and purely combinatorial proofs of these bijections, focusing on the rigid symmetry structures of the Young diagrams. In the triangular weight case, we show that the corresponding diagrams are quasi-symmetric, i.e. symmetric up to a single extra column. We extend this analysis to the nontriangular case, showing that the diagrams either exhibit this same quasi-symmetric structure or are perfectly self-conjugate, depending on the maximal part.

💡 Research Summary

The paper investigates the combinatorial structure of unrefinable partitions by exploiting their deep connections with numerical sets and Young diagrams via the Keith–Nath (KN) transformation. An unrefinable partition is defined as a partition into distinct parts that cannot replace any of its parts by a sum of two or more distinct positive integers none of which already appear in the partition. The authors first recall known upper bounds for the largest part λₜ of a maximal unrefinable partition, distinguishing between triangular weights Tₙ = n(n+1)/2 and non‑triangular weights Tₙ,₍d₎ = Tₙ – d.

The central tool is the KN transformation, which maps a partition λ to a numerical set S(λ) whose gaps correspond exactly to the parts of λ. By representing S(λ) as a Young diagram D(S), the hook lengths of the diagram coincide with the gap set. The authors prove a geometric criterion (Proposition 2.9): a partition is unrefinable if and only if all hook lengths in the associated Young diagram are distinct. This provides a purely visual test for unrefinability, bypassing any need to enumerate possible refinements.

For triangular weights with odd n, the authors show that maximal unrefinable partitions correspond to Young diagrams that are “quasi‑symmetric”: the diagram is symmetric with respect to the main diagonal except for a single extra column immediately to the right of the diagonal. The hook lengths in this extra column encode a bijection between the maximal unrefinable partitions of Tₙ and the set of partitions of (n+1)/2 into distinct parts (Theorem 3.25). When n is even, there is only one maximal unrefinable partition, which the paper treats as a trivial case.

In the non‑triangular setting Tₙ,₍d₎, two distinct geometric patterns emerge depending on the parity of n – d. If n – d is even, maximal unrefinable partitions have largest part λₜ = 2n – 5 and their Young diagrams are perfectly self‑conjugate (i.e., invariant under transpose). If n – d is odd, the largest part is λₜ = 2n – 4 and the diagrams again exhibit the quasi‑symmetric structure described above. These structural observations lead to explicit combinatorial bijections: for the even‑difference case the diagrams map to partitions into distinct odd parts (Theorem 4.14), while for the odd‑difference case they map to ordinary distinct‑part partitions (Theorem 5.3).

A crucial symmetry property, valid for all maximal unrefinable partitions, is that λₜ² never appears as a part and that for any x ≠ λₜ² we have x ∈ λ ⇔ λₜ – x ∈ λ. This mirrors the reflection symmetry of the Young diagram about the main diagonal and is repeatedly used to simplify proofs.

Beyond the theoretical classification, the hook‑length criterion yields an efficient algorithmic test for unrefinability: checking distinctness of hook lengths can be performed in linear time with respect to the number of parts. Moreover, the geometric viewpoint clarifies why the previously known enumerative results (e.g., counts of maximal unrefinable partitions and their bijections with subsets of distinct‑part partitions) hold, and it opens the door to further applications linking partition theory with numerical semigroup theory, core partitions, and Arf semigroups.

In summary, the paper provides a unified geometric framework that translates the combinatorial condition of unrefinability into a simple property of Young diagrams. It classifies maximal unrefinable partitions for both triangular and non‑triangular weights, establishes new bijective proofs of known correspondences, and highlights the power of the Keith–Nath transformation as a bridge between partitions, numerical sets, and diagrammatic geometry. This approach not only streamlines existing results but also suggests promising directions for algorithmic and theoretical developments in the study of partitions and numerical semigroups.