The irreducibility conjecture for normalized cusp polynomials

About 3 years old · traced to

Define

Pd(t;q):={NHd(t;q),d even,NHd(t;q)/(1+qdt),d odd.P_d(t;q):= \begin{cases} \mathit{NH}_d(t;q),&d\text{ even},\\ \mathit{NH}_d(t;q)/(1+q^d t),&d\text{ odd}. \end{cases}

Let Φr(q)\Phi_r(q) denote the cyclotomic polynomial of order rr. The normalized cusp-polynomial irreducibility conjecture. The polynomial Pd(t;q)P_d(t;q) lies in Z[t,q]\mathbb{Z}[t,q], has nonnegative coefficients, and is irreducible or equal to 11. For every integer m≠−1m\ne-1, Pd(m;q)P_d(m;q) is irreducible in Z[q]\mathbb{Z}[q]. Finally,

Pd(−1;q)=Id(q)∏1≤r≤d odd˚Φr(q)⌊d+r−12r⌋,P_d(-1;q)=I_d(q)\prod_{\substack{1\leq r\leq d\r\text{ odd}}}\Phi_r(q)^{\left\lfloor\frac{d+r-1}{2r}\right\rfloor},

where Id(q)I_d(q) is irreducible in Z[q]\mathbb{Z}[q].

The factorization pattern was verified computationally for d≤30d\leq 30 and selected values of tt, but the general assertions remain open.

References

Primary source

Yifeng Huang and Ruofan Jiang, “Punctual Quot schemes and Cohen–Lenstra series of the cusp singularity”, arXiv:2305.06411 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.