Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diophantine m-tuples in finite fields and modular forms

Published 29 Sep 2016 in math.NT | (1609.09356v2)

Abstract: For a prime p, a Diophantine m-tuple in $\mathbb{F}_p$ is a set of m nonzero elements of $\mathbb{F}_p$ with the property that the product of any two of its distinct elements is one less than a square. In this paper, we present formulas for the number $N{(m)}(p)$ of Diophantine m-tuples in $\mathbb{F}_p$ for m=2,3 and 4. Fourier coefficients of certain modular forms appear in the formula for the number of Diophantine quadruples. We prove that asymptotically $N{(m)}(p)=\frac{1}{2{m \choose 2 }}\frac{pm}{m!} + o(pm)$, and also show that if $p>2{2m-2}m2$, then there is at least one Diophantine m-tuple in $\mathbb{F}_p$.

Summary

Paper to Video (Beta)

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.

Collections

Sign up for free to add this paper to one or more collections.