Metraipolis › archive › dc_c49f1fefffe6
Cyclic permutations of large subsets with polynomial values in multiplicative subgroups of finite fields — arXiv:2608.12758
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12758
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:52:38.911Z
- SHA-256 of the archived text
c19f0e660003d7bdcde0e81919efdd1fff29e000451b5b416a654f17b1a1b873- Stable URL of this page
https://metraipolis.com/documento/dc_c49f1fefffe6
How to cite
Cyclic permutations of large subsets with polynomial values in multiplicative subgroups of finite fields — arXiv:2608.12758 — arXiv (en), https://arxiv.org/abs/2608.12758 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c49f1fefffe6 (Metraipolis archive dc_c49f1fefffe6, sha256 c19f0e660003d7bdcde0e81919efdd1fff29e000451b5b416a654f17b1a1b873)
BibTeX
@misc{dcc49f1fefffe6,
title = {Cyclic permutations of large subsets with polynomial values in multiplicative subgroups of finite fields — arXiv:2608.12758},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12758},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c49f1fefffe6; sha256 c19f0e660003d7bdcde0e81919efdd1fff29e000451b5b416a654f17b1a1b873},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12758. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $f(t)\in\mathbb{Z}[t]$ be a nonconstant polynomial with nonzero discriminant and let $k\ge2$ be an integer. Inspired by the work of Alon and Bourgain, for sufficiently large prime $p\equiv1\pmod{k}$, we study cyclic orderings of subsets $A\subseteq \mathbb{F}_p$ for which $ f(a_i+a_{i+1})$ is a nonzero $k$-th power for every consecutive pair. By combining mixed character-sum estimates, Fourier analysis on $\mathbb{F}_p$, and spectral graph methods, we establish a threshold $c(p,k,f)$ such that every subset $A$ with $\#A\ge c(p,k,f)$ admits such a cyclic ordering. We also give lower and upper bounds for the optimal threshold.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.12758 — 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-19T04:28:16.185Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).