The irreducibility conjecture for the numerator of the binary-form Poincaré series
Let , and write the Poincaré series in lowest terms as
where are relatively prime and . Irreducibility conjecture. The polynomial is irreducible for every . The paper presents this as an additional conjecture after reporting computations through ; no general proof is given in the supplied text.
References
Primary source
Dragomir Ž. Djoković, “A heuristic algorithm for computing the Poincaré series of the invariants of binary forms”, arXiv:math/0608147 (2006).
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.