$f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918450928025600 |
|---|---|
| author | Kim, Seoyoung Yip, Chi Hoi Yoo, Semin |
| author_facet | Kim, Seoyoung Yip, Chi Hoi Yoo, Semin |
| contents | We investigate $f$-Diophantine sets over finite fields via new explicit constructions of families of quasi-random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi-random hypergraphs but also provides a unified framework for studying various hypergraphs arising from multivariate polynomials over finite fields, including Paley sum hypergraphs, and hypergraphs derived from Diophantine tuples and their generalizations. We derive an asymptotic formula for the number of $k$-Diophantine $m$-tuples, answering a question of Hammonds et al., and study some related questions for $f$-Diophantine sets, extending and improving several recent works. We also sharpen a classical estimate of Chung and Graham on even partial octahedrons in Paley sum hypergraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_19603 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | $f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials Kim, Seoyoung Yip, Chi Hoi Yoo, Semin Combinatorics Number Theory Primary: 11T06, 05C80. Secondary: 05C65, 11D72, 11B30 We investigate $f$-Diophantine sets over finite fields via new explicit constructions of families of quasi-random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi-random hypergraphs but also provides a unified framework for studying various hypergraphs arising from multivariate polynomials over finite fields, including Paley sum hypergraphs, and hypergraphs derived from Diophantine tuples and their generalizations. We derive an asymptotic formula for the number of $k$-Diophantine $m$-tuples, answering a question of Hammonds et al., and study some related questions for $f$-Diophantine sets, extending and improving several recent works. We also sharpen a classical estimate of Chung and Graham on even partial octahedrons in Paley sum hypergraphs. |
| title | $f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials |
| topic | Combinatorics Number Theory Primary: 11T06, 05C80. Secondary: 05C65, 11D72, 11B30 |
| url | https://arxiv.org/abs/2503.19603 |