Papers
Topics
Authors
Recent
Search
2000 character limit reached

On large FF-Diophantine sets

Published 28 Aug 2017 in math.NT | (1708.08525v1)

Abstract: Let F∈Z[x,y]F\in\mathbb{Z}[x,y] and m≥2m\ge2 be an integer. A set A⊂ZA\subset \mathbb{Z} is called an (F,m)(F,m)-Diophantine set if F(a,b)F(a,b) is a perfect mm-power for any a,b∈Aa,b\in A where a≠ba\ne b. If FF is a bivariate polynomial for which there exist infinite (F,m)(F,m)-Diophantine sets, then there is a complete qualitative characterization of all such polynomials FF. Otherwise, various finiteness results are known. We prove that given a finite set of distinct integers S S of size nn, there are infinitely many bivariate polynomials FF such that S S is an (F,2)(F,2)-Diophantine set. In addition, we show that the degree of FF can be as small as 4⌊n/3⌋\displaystyle 4\lfloor n/3\rfloor.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.