Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$F$-Diophantine sets over finite fields (2406.00310v2)

Published 1 Jun 2024 in math.NT

Abstract: Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q*$ such that $F(a_1, a_2, \ldots, a_k)$ is a square in $\mathbb{F}_q$ whenever $a_1, a_2, \ldots, a_k$ are distinct elements in $A$. In this paper, we provide a strategy to construct a large $F$-Diophantine set, provided that $F$ has a nice property in terms of its monomial expansion. In particular, when $F=x_1x_2\ldots x_k+1$, our construction gives a $k$-Diophantine tuple over $\mathbb{F}_q$ with size $\gg_k \log q$, significantly improving the $\Theta((\log q){1/(k-1)})$ lower bound in a paper by Hammonds-Kim-Miller-Nigam-Onghai-Saikia-Sharma.

Summary

We haven't generated a summary for this paper yet.