The irreducibility conjecture for the numerator of the binary-form Poincaré series
The irreducibility conjecture for the numerator of the binary-form Poincaré series
From papers
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.
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
Dragomir Ž. Djoković, “A heuristic algorithm for computing the Poincaré series of the invariants of binary forms”, arXiv:math/0608147 (2006).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.