The irreducibility conjecture for the numerator of the binary-form Poincaré series

From papers

Let n3n\ge3, and write the Poincaré series in lowest terms as

Pn(t)=An(t)Bn(t),P_n(t)=\frac{A_n(t)}{B_n(t)},

where An,BnZ[t]A_n,B_n\in\mathbf Z[t] are relatively prime and An(0)=Bn(0)=1A_n(0)=B_n(0)=1. Irreducibility conjecture. The polynomial An(t)A_n(t) is irreducible for every n5n\ge5. The paper presents this as an additional conjecture after reporting computations through n=30n=30; 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

No solutions have been posted yet.