Wan's conjecture on limiting Newton polygons

About 19 years old · traced to

Let ff be a non-constant monic polynomial in Q[x]Q[x]. A global permutation polynomial (GPP) over QQ is a polynomial P(x)\inQ[x]P(x)\inQ[x] whose reduction modulo pp is a permutation of kpk_p for infinitely many finite places pp. A polynomial g(x)g(x) is a composition factor of ff if f=g∘hf=g\circ h for some polynomial hh. Wan's conjecture. The polynomial ff contains a GPP over QQ of degree greater than 11 as a composition factor if and only if

lim⁡p∈ΣQNP⁡p(f)\lim_{\mathfrak p\in\Sigma_{Q}} \operatorname{NP}_{\mathfrak p}(f)

does not exist. This conjecture relates arithmetic decompositions of polynomials through global permutation polynomials to the existence of limiting qq-adic Newton polygons of their exponential-sum LL-functions; the supplied text gives no evidence resolving it.

References

Primary source

Yi Ouyang and Jinbang Yang, “On a conjecture of Wan about limiting Newton polygons”, arXiv:1510.07772 (2015).

Additional references

2 papers in this index state this conjecture (2007–2015). The statement above is taken from the most recent of them; the others are arXiv:0706.2340.

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.