2000 character limit reached
Cubic Thue inequalities with positive discriminant
Published 22 Jul 2013 in math.NT | (1307.5692v1)
Abstract: We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided that h is smaller than D{1/4}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.