Metraipolis › archive › dc_d44f9511bf7b
Congruence Classes in $\mathbb{F}_p^2$: Sharp Results via an Energy Approach — arXiv:2609.29784
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29784
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:40:58.711Z
- SHA-256 of the archived text
904d6350ddef9f7123f0b491a6d638f7346af73fed9801582db7cbfa7540b36f- Stable URL of this page
https://metraipolis.com/documento/dc_d44f9511bf7b
How to cite
Congruence Classes in $\mathbb{F}_p^2$: Sharp Results via an Energy Approach — arXiv:2609.29784 — arXiv (en), https://arxiv.org/abs/2609.29784 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d44f9511bf7b (Metraipolis archive dc_d44f9511bf7b, sha256 904d6350ddef9f7123f0b491a6d638f7346af73fed9801582db7cbfa7540b36f)
BibTeX
@misc{dcd44f9511bf7b,
title = {Congruence Classes in $mathbbF_p^2$: Sharp Results via an Energy Approach — arXiv:2609.29784},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29784},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d44f9511bf7b; sha256 904d6350ddef9f7123f0b491a6d638f7346af73fed9801582db7cbfa7540b36f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29784. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $T_k(E)$ denote the set of congruence classes of ordered $k$-tuples of pairwise distinct points of $E$. Let $p\equiv3\pmod4$ be prime. For $E\subset\mathbb{F}_p^2$ with $3\leq|E|\leq p^{3/4}$, we prove that $|T_3(E)|\gg|E|^{11/6}$; for $4\leq|E|\leq p^{3/4}$, we prove that $|T_4(E)|\gg|E|^3/\log|E|$. For every fixed $k\geq5$ and $k\leq|E|\leq p^{3(k-2)/(3k-4)}$, we prove that $|T_k(E)|\gg_k|E|^{k-1}$. The proofs proceed by bounding the moments of the overlap function of rigid motions. The main inputs are an exact identity involving the distance energy and an incidence bound obtained by viewing rigid motions as lines over $\mathbb{F}_p(i)$. The bound for $k=4$ is sharp up to a logarithmic factor, while the bounds for $k\geq5$ are sharp up to constants.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2609.29784 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T06:02:10.068Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).