Metraipolis › archive › dc_fd3d7066ef1a

Arithmetic progressions in dense subsets of primitive elements of finite fields — arXiv:2609.29653

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29653
License (as archived)
CC0-1.0
Archived
2026-10-08T06:41:11.532Z
SHA-256 of the archived text
697a0c0f2acd423e816f056e5da6ba16bc3ecb396cbdddbe28de1c3968efa187
Stable URL of this page
https://metraipolis.com/documento/dc_fd3d7066ef1a

How to cite

Arithmetic progressions in dense subsets of primitive elements of finite fields — arXiv:2609.29653 — arXiv (en), https://arxiv.org/abs/2609.29653 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd3d7066ef1a (Metraipolis archive dc_fd3d7066ef1a, sha256 697a0c0f2acd423e816f056e5da6ba16bc3ecb396cbdddbe28de1c3968efa187)
BibTeX
@misc{dcfd3d7066ef1a,
  title = {Arithmetic progressions in dense subsets of primitive elements of finite fields — arXiv:2609.29653},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29653},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd3d7066ef1a; sha256 697a0c0f2acd423e816f056e5da6ba16bc3ecb396cbdddbe28de1c3968efa187},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29653. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $p$ be a prime and let $\mathcal{P}_p$ be the set of primitive elements of $\mathbb{F}_p$. Inspired by the work of Cohen, Oliveira e Silva and Trudgian on consecutive primitive elements, and by the work of Chang on arithmetic progressions in multiplicative subgroups of finite fields, in this paper, using estimates for multiplicative character sums over systems of linear forms together with the relative Szemerédi's theorem of Conlon, Fox and Zhao, we show that, for every fixed integer $k\ge3$ and any fixed number $0<\delta\le 1$, each subset $A\subseteq\mathcal{P}_p$ with $\#A\ge\delta\#\mathcal{P}_p$ contains a nontrivial $k$-term arithmetic progression, provided that $p$ is sufficiently large. Also, by applying Behrend's theorem, we construct a large subset $A'$ of $\mathcal{P}_p$ with $\#A'=\lfloor(\#\mathcal{P}_p)^{1-\varepsilon}\rfloor$ such that $A'$ contains no nontrivial $k$-term arithmetic progressions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.29653 — 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.127Z 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).