Degree theory of the partition graph: exact maxima, profiles, and fibres
Abstract
For the partition graph Gn, whose vertices are the partitions of n and whose edges correspond to elementary unit transfers between parts, we develop a degree theory with three levels: exact value theory, exact profile theory, and fibre-level geometry. Writing n=Ts+q with Ts=s(s+1)/2 and 0 q s, we prove that every degree-maximizing partition lies in the support-maximal stratum and obtain the exact formula \[ n=s(s-1)+4q+1-1 \] for the maximal degree in Gn. For a support-maximal partition λ, let A(λ) and B(λ) denote the numbers of active gap bonuses and multiplicity bonuses. We prove that the set of realized maximizing profiles is \[ n=\(a,b)∈ Z02:a+b=(q),\ Ta+Tb q\, (q)=4q+1-1. \] Thus the exact global theory stops at the profile level. For each realized profile we then study the corresponding fibre of maximizers: we prove nonemptiness, construct canonical representatives, obtain lower bounds for mixed fibres, and show that conjugation induces a bijection between the fibres for (a,b) and (b,a). We also classify exactly the first near-triangular fibre windows and formulate localization and stability questions for the remaining fixed-q regime.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.