Newton approximation fails for 100% of the primes

Let ff be a polynomial of degree d2d\geq 2 with coefficients in a number field KK, and let x0Kx_0\in K. Define the Newton map

N(t)=tf(t)f(t),N(t)=t-\frac{f(t)}{f'(t)},

and, for each n0n\geq 0, set

xn+1=N(xn).x_{n+1}=N(x_n).

Assume that the Newton approximation sequence (xn)(x_n) is not eventually periodic. Let C(K,f,x0)C(K,f,x_0) be the set of places vv of KK for which (xn)(x_n) converges vv-adically to a root of ff. Newton approximation fails for 100% of the primes. The natural density of C(K,f,x0)C(K,f,x_0) is zero. This gives a precise form of the paper's heuristic that convergence places are sparse; the statement is presented as a conjecture and no resolution is supplied here.

Sources & referencesView supporting material

Primary source

Xander Faber and José Felipe Voloch, “On the Number of Places of Convergence for Newton's Method over Number Fields”, arXiv:1003.1236 (2010).

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.