$k$-Diophantine $m$-tuples in Finite Fields
Trajan Hammonds, Seoyoung Kim, Steven J. Miller, Arjun Nigam, Kyle, Onghai, Dishant Saikia, Lalit M. Sharma

TL;DR
This paper investigates $k$-Diophantine $m$-tuples in finite fields, establishing existence conditions, explicit formulas for triples, and asymptotic counts for larger sets, advancing understanding of these special number sets in finite algebraic structures.
Contribution
It introduces the concept of $k$-Diophantine $m$-tuples in finite fields, provides explicit existence bounds, and derives formulas for counting such tuples.
Findings
Existence of $k$-Diophantine $m$-tuples for large primes p
Explicit formula for the number of 3-Diophantine triples in $_p$
Asymptotic formula for the number of $k$-Diophantine $k$-tuples
Abstract
In this paper, we define a -Diophantine -tuple to be a set of positive integers such that the product of any distinct positive integers is one less than a perfect square. We study these sets in finite fields for odd prime and guarantee the existence of a -Diophantine m-tuple provided is larger than some explicit lower bound. We also give a formula for the number of 3-Diophantine triples in as well as an asymptotic formula for the number of -Diophantine -tuples.
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
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Analytic Number Theory Research
