The height bound conjecture for rational points on hyperelliptic curves

For an integer d3d\geq 3, let fQ[x]f\in\mathbb{Q}[x] be a polynomial of degree dd with nonzero discriminant, and let h(f)h(f) denote the maximum of the logarithmic heights of its coefficients. The height bound conjecture. There exist constants C1=C1(d)C_1=C_1(d) and C2=C2(d)C_2=C_2(d) such that, for every such polynomial ff and all x,yQx,y\in\mathbb{Q} satisfying

t2=f(x),t^2=f(x),

one has

h(x)C1h(f)+C2.h(x)\leq C_1\cdot h(f)+C_2.

The source presents this as a conjecture that, in degree at least 55, follows from Vojta's conjecture over Q\mathbb{Q}; it is used to obtain infinitely many rational specializations with prescribed index-two arboreal Galois images.

Sources & referencesView supporting material

Primary source

Andrea Ferraguti, Carlo Pagano and Daniele Casazza, “The inverse problem for arboreal Galois representations of index two”, arXiv:1907.08608 (2023).

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.