Dot-product graphs in finite fields
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915595429085184 |
|---|---|
| author | Xie, Chengfei Ge, Gennian |
| author_facet | Xie, Chengfei Ge, Gennian |
| contents | In this paper, we study the dot-product graphs in $\mathbb{F}_q^d$. We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field Fourier analytic techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_02313 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Dot-product graphs in finite fields Xie, Chengfei Ge, Gennian Combinatorics Number Theory 11T30, 11T23, 52C10 In this paper, we study the dot-product graphs in $\mathbb{F}_q^d$. We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field Fourier analytic techniques. |
| title | Dot-product graphs in finite fields |
| topic | Combinatorics Number Theory 11T30, 11T23, 52C10 |
| url | https://arxiv.org/abs/2511.02313 |