Trinomial family conjecture for finding polynomials satisfying Property condition

About 9 years old · traced to

Let pp be the prime associated with the finite field under consideration, and let T(n,k,a,b)={xn+axk+b∣n>k>0; a,b∈Z∗}\mathcal{T}_{(n,k,a,b)}=\{x^n+ax^k+b\mid n>k>0;\ a,b\in\mathbb{Z}^*\} be the family of trinomials. Define

F={T(2i,k,a,b)∣1≤i,k,a,b≤log⁡2p}.\mathcal{F}=\{\mathcal{T}_{(2i,k,a,b)}\mid 1\leq i,k,a,b\leq\log^2 p\}.

Trinomial family conjecture. The family F\mathcal{F} contains at least one polynomial satisfying Property condition for r=2r=2.

This conjecture proposes an explicit bounded-parameter family for constructing a polynomial with the required property; the source leaves both a proof and a refutation open.

References

Primary source

Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal and Nitin Saxena, “Irreducibility and r-th root finding over finite fields”, arXiv:1702.00558 (2017).

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.