arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.09356math.NT
收藏

有限域中的丢番图m元组与模形式

Diophantine m-tuples in finite fields and modular forms

Andrej Dujella, Matija Kazalicki

摘要:

对于素数p,$\mathbb{F}_p$中的丢番图m元组是$\mathbb{F}_p$的m个非零元素的集合,其性质是其任何两个不同元素的乘积比平方小小于1。本文给出了当m= 2,3和4时,$\mathbb{F}_p$中丢番图m元组个数$N^{(m)}(p)$的计算公式.某些模形式的傅里叶系数出现在丢番图四元组数的公式中。我们证明了渐近地$N^{(m)}(p)=\frac{1}{2^{m \choose 2 }}\frac{p^m}{m!} + o(p^m)$,并且还表明,如果$p>2^{2m-2}m^2$,那么至少有一个丢番图m-元组在$\mathbb{F}_p$。

英文摘要:

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{p^m}{m!} + o(p^m)$, and also show that if $p>2^{2m-2}m^2$, then there is at least one Diophantine m-tuple in $\mathbb{F}_p$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑