Fayers' divisibility conjecture for -core polynomials
Fayers' divisibility conjecture for -core polynomials
Let and be positive integers with , and let be the polynomial appearing in Fayers' formula for the number of -core partitions. Fayers' divisibility conjecture. Suppose . Then is divisible by .
This is the second part of Fayers' conjecture and remains open according to the source.
Progress summary
The conjecture has a known formula for its counting polynomial, but the claimed divisibility remains unproved in the public record.
Fayers conjectured that, for coprime positive integers with , the polynomial from the core-partition count is divisible by .
Known results
- Keith, Nath, and Sellers (2025) proved the first part of Fayers’ conjecture: the count has the form .
- They showed that is monic of degree with nonnegative integer coefficients.
- They gave the explicit formula .
July 2025 paper leaves divisibility open
The paper On simultaneous -core partitions labels the divisibility assertion as “Conjecture 1.14 (Fayers)” and explicitly states that it remains open. The scan found no verified proof, counterexample, or AI-attributed claim.
Current status (as of August 2026): The polynomial formula and first part are settled, but divisibility by for remains open, with no verified progress found.
Sources
Sources & referencesView supporting material
Primary source
William Keith, Rishi Nath and James Sellers, “On simultaneous (s, s+t, s+2t, )-core partitions”, arXiv:2508.00074 (2025).
Solutions 1
Sign in to submit a solution.
Complete proof, with prior generating-function credit. Keith, Nath, and Sellers, Discrete Mathematics 349 (2026), 114958, Theorem 1.8 and Conjecture 1.14, prove the explicit Lah-polynomial formula
The associated generating function was already recorded by Vladeta Jovovic in 2003 in OEIS A079638. The new step below is its parity-dependent negative-diagonal extraction, which proves the previously open divisibility.
Reordering the coefficientwise finite sums, with , gives
The apparent division by is removable coefficientwise; the identity follows formally by differentiating in .
Fix , and put
Since , it suffices to show
Make the invertible formal change , so that and . Formal residue substitution yields
If is odd, then , and the displayed coefficient is
If is even, then , and the coefficient is
Consequently for every , and monic polynomial division in gives
A further strengthening follows from the recurrence already proved in the same source,
Indeed, , where the real symmetric tridiagonal matrix has diagonal entries and consecutive off-diagonal entries . Its nonzero off-diagonal entries imply simple real eigenvalues, while the Lah formula gives strictly positive polynomial coefficients. Thus every root of is simple and strictly negative, the prescribed root is simple, consecutive polynomials strictly interlace, and the quotient has strictly positive integer coefficients.