Thue equation “funnel”

In this post I will be detailing a problem I have thought about for about a year, but has not made any progress on. The problem is one posed by my advisor, Professor Cameron Stewart, in the following paper:

C.L. Stewart, On the number of solutions of polynomial congruences and Thue equations, Journal of the AMS, (4) 4 (1991), 793-835.

His conjecture can be seen on page 816 of the above paper:

“… we conjecture that there exists an absolute constant c_0 such that for any binary form F \in \mathbb{Z}[x,y] with nonzero discriminant and degree at least three there exists a number C, which depends on F, such that if h is an integer larger than C then the Thue equation [F(x,y) = h] has at most c_0 solutions in coprime integers x and y.”

In the same paper, Stewart proves that the equation F(x,y) = h has no more than O((\deg F)^{1 + \omega(g)}) solutions, where g is a large divisor of h. The crucial point is that quite often, we can pick g which has few prime divisors, so that \omega(g) is small (see also this recent preprint due to Shabnam Akhtari: http://arxiv.org/abs/1508.03602).

However, this situation should not be typical. The basic idea is that when h is large with respect to the coefficients of F, that F(x,y) = h should behave `generically’, meaning that most of the points on the plane curve defined by the Thue equation should have few rational points. Indeed, generically the curve F(x,y) = h should be of general type (i.e. have genus at least 2), so one should not expect too many rational points by Faltings’ theorem.

Nevertheless, if one checks Stewart’s argument (this particular part is not necessarily new; Bombieri and Schmidt had used roughly the same idea in other papers), then one sees that a crucial ingredient is a p-adic reduction lemma. In particular, for a prime p and a positive integer k such that p^k || h, one can transform the equation F(x,y) = h into at most d = \deg F many equations of the form F_i(x,y) = hp^{-k}. Indeed, this is where the power of d appears in Stewart’s theorem. Another crucial input of Stewart, arguably the most novel part of his paper, is that he shows that the equation F(x,y) = n has few solutions provided that n is sufficiently small with respect to various invariants of F; in particular, he does not require that n = 1.

The deficit of Stewart’s argument, as with all other related results, is that it fundamentally obtains the ‘wrong’ bound: one should expect fewer solutions to the equation F(x,y) = h when h is large, not more. In particular, all arguments involve some sort of reduction or descent argument and reducing the equation to one where the right hand side is a small integer, thereby susceptible to various diophantine approximation arguments, at a cost that is not so severe. This type of argument is unlikely to be useful in resolving Stewart’s conjecture.

However, recent groundbreaking work due to Manjul Bhargava offer hope. In this paper, Bhargava shows that most hyperelliptic curves in the sense of some natural density with respect to the coefficients of the curve written as z^2 = f(x,y) with f a binary form with integral coefficients and even degree, have no rational points. One of the most ingenious constructions in the paper is an explicit representation of a binary form f(x,y) whenever the curve

z^2 = f(x,y)

has a rational point. Indeed, if the curve above has a rational point (z_0, x_0, y_0) say, then there exist integer matrices A,B \in \text{GL}_{2n}(\mathbb{Z}) with 2n = \deg f such that

f(x,y) = (-1)^n \det(Ax - By).

He then showed that most binary forms cannot be represented in the above way, thereby showing that most hyperelliptic curves have no rational points.

If one carries out Stewart’s p-adic reduction argument all the way down to 1, we see the following. Start with a generic equation F(x,y) = h, apply a descent argument, and end up with a bunch of equations of the form \mathcal{F}(x,y) = 1. In particular, the curve defined by

\mathcal{F}(x,y) = z^2

has a rational point! Therefore, it must be one of the rare binary forms with a representation of the form (-1)^n \det(Ax - By). I call this effect ‘funneling’, because we start with a generic, typical object and end up with a special object. Therefore, all of the initial data had to pass through a ‘general to special’ funnel. Since the final object is so rare, the initial object could not be too abundant; otherwise we would ‘violate’ Bhargava’s result.

Of course, the above paragraph is too coarse and fuzzy to formulate precise statements, much less proving a rigorous theorem. However, I still believe that this `funnel’ should exist and that it will lead to a solution to Stewart’s conjecture.

If you have any insights or ideas, please feel free to contact me, I would be extremely pleased if this question gets an answer.

Advertisements

2 thoughts on “Thue equation “funnel”

  1. Pingback: Bhargavaology and Chabauty implies weak Stewart’s conjecture ‘almost surely’ | The Conscious Mathematician

  2. Pingback: Some problems for the new year | The Conscious Mathematician

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s