The irreducibility conjecture for normalized cusp polynomials
The irreducibility conjecture for normalized cusp polynomials
Define
Let denote the cyclotomic polynomial of order . The normalized cusp-polynomial irreducibility conjecture. The polynomial lies in , has nonnegative coefficients, and is irreducible or equal to . For every integer , is irreducible in . Finally,
where is irreducible in .
The factorization pattern was verified computationally for and selected values of , but the general assertions remain open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Yifeng Huang and Ruofan Jiang, “Punctual Quot schemes and Cohen–Lenstra series of the cusp singularity”, arXiv:2305.06411 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.