$F$-Diophantine sets over finite fields
Chi Hoi Yip, Semin Yoo

TL;DR
This paper introduces a method to construct large $F$-Diophantine sets over finite fields for certain polynomials, notably improving known bounds for the case $F=x_1x_2...x_k+1$, with implications for Diophantine tuples.
Contribution
It provides a new construction strategy for large $F$-Diophantine sets over finite fields, especially for polynomials with specific monomial properties, improving previous bounds.
Findings
Constructs large $F$-Diophantine sets when $F$ has a monomial expansion property.
Achieves size $ ext{gg}_k ext{log} q$ for $k$-Diophantine tuples with $F=x_1x_2...x_k+1$.
Significantly improves lower bounds over previous results.
Abstract
Let , be an odd prime power, and be a polynomial. An -Diophantine set over a finite field is a set such that is a square in whenever are distinct elements in . In this paper, we provide a strategy to construct a large -Diophantine set, provided that has a nice property in terms of its monomial expansion. In particular, when , our construction gives a -Diophantine tuple over with size , significantly improving the lower bound in a recent paper by Hammonds-Kim-Miller-Nigam-Onghai-Saikia-Sharma.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Cryptography and Residue Arithmetic
