Fayers' divisibility conjecture for (s,s+t,s+2t,)(s,s+t,s+2t,\dots)-core polynomials

From papers

Let ss and tt be positive integers with gcd(s,t)=1\gcd(s,t)=1, and let ft(s)f_t(s) be the polynomial appearing in Fayers' formula for the number of (s,s+t,s+2t,)(s,s+t,s+2t,\dots)-core partitions. Fayers' divisibility conjecture. Suppose t2t \geq 2. Then ft(s)f_t(s) is divisible by s+t+(1)ts+t+(-1)^t.

This is the second part of Fayers' conjecture and remains open according to the source.

Progress summary

Open

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 s,ts,t with t2t \geq 2, the polynomial ft(s)f_t(s) from the core-partition count is divisible by s+t+(1)ts+t+(-1)^t.

Known results

  • Keith, Nath, and Sellers (2025) proved the first part of Fayers’ conjecture: the count has the form 2stft(s)/t!2^{s-t}f_t(s)/t!.
  • They showed that ft(s)f_t(s) is monic of degree t1t-1 with nonnegative integer coefficients.
  • They gave the explicit formula ft(s)=m=1tt!m!(t1m1)(s+1)m1f_t(s)=\sum_{m=1}^{t}\frac{t!}{m!}\binom{t-1}{m-1}(s+1)^{\overline{m-1}}.

July 2025 paper leaves divisibility open

The paper On simultaneous (s,s+t,s+2t,)(s,s+t,s+2t,\dots)-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 s+t+(1)ts+t+(-1)^t for t2t \geq 2 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

Proof

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

ft(s)=m=1tt!m!(t1m1)(s+1)m1Z[s].f_t(s)=\sum_{m=1}^{t}\frac{t!}{m!}\binom{t-1}{m-1}(s+1)^{\overline{m-1}}\in\mathbb Z[s].

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 y=z/(1z)y=z/(1-z), gives

t1ft(s)t!zt=m1(s+1)m1m!(z1z)m=1s[(1z12z)s1].\begin{aligned} \sum_{t\ge1}\frac{f_t(s)}{t!}z^t &=\sum_{m\ge1}\frac{(s+1)^{\overline{m-1}}}{m!} \left(\frac z{1-z}\right)^m\\ &=\frac1s\left[\left(\frac{1-z}{1-2z}\right)^s-1\right]. \end{aligned}

The apparent division by ss is removable coefficientwise; the identity follows formally by differentiating in yy.

Fix t2t\ge2, and put

s0=t(1)t,M=s0=t+(1)t>0.s_0=-t-(-1)^t,\qquad M=-s_0=t+(-1)^t>0.

Since s00s_0\ne0, it suffices to show

[zt](12z1z)M=0.[z^t]\left(\frac{1-2z}{1-z}\right)^M=0.

Make the invertible formal change w=z/(1z)w=z/(1-z), so that z=w/(1+w)z=w/(1+w) and dz=dw/(1+w)2dz=dw/(1+w)^2. Formal residue substitution yields

[zt](12z1z)M=[wt](1+w)t1(1w)M.[z^t]\left(\frac{1-2z}{1-z}\right)^M =[w^t](1+w)^{t-1}(1-w)^M.

If tt is odd, then M=t1M=t-1, and the displayed coefficient is

[wt](1w2)t1=0.[w^t](1-w^2)^{t-1}=0.

If t=2ht=2h is even, then M=t+1M=t+1, and the coefficient is

[w2h](1w2)2h1(1w)2=(1)h(2h1h)+(1)h1(2h1h1)=0.\begin{aligned} [w^{2h}](1-w^2)^{2h-1}(1-w)^2 &=(-1)^h\binom{2h-1}{h} +(-1)^{h-1}\binom{2h-1}{h-1}\\ &=0. \end{aligned}

Consequently ft(t(1)t)=0f_t(-t-(-1)^t)=0 for every t2t\ge2, and monic polynomial division in Z[s]\mathbb Z[s] gives

s+t+(1)tft(s)in Z[s],t2.\boxed{\quad s+t+(-1)^t\mid f_t(s)\quad\text{in }\mathbb Z[s],\qquad t\ge2.\quad}

A further strengthening follows from the recurrence already proved in the same source,

ft(s)=(s+3(t1))ft1(s)2(t1)(t2)ft2(s).f_t(s)=(s+3(t-1))f_{t-1}(s)-2(t-1)(t-2)f_{t-2}(s).

Indeed, ft(s)=det(sIt1Jt1)f_t(s)=\det(sI_{t-1}-J_{t-1}), where the real symmetric tridiagonal matrix JJ has diagonal entries 3j-3j and consecutive off-diagonal entries 2j(j+1)\sqrt{2j(j+1)}. Its nonzero off-diagonal entries imply simple real eigenvalues, while the Lah formula gives strictly positive polynomial coefficients. Thus every root of ftf_t is simple and strictly negative, the prescribed root is simple, consecutive polynomials strictly interlace, and the quotient ft(s)/(s+t+(1)t)f_t(s)/(s+t+(-1)^t) has strictly positive integer coefficients.

0 endorsements
Shivam Patel ·