Metraipolis › archive › dc_666135596a67
Extremal permutations of $\mathbb{Z}_n$ with many good slopes and applications to quantum Latin squares — arXiv:2611.01465
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01465
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:43.736Z
- SHA-256 of the archived text
9151617d28d4f3503058391c02036fa656e74cb2942ac47ed17f1e083de300e1- Stable URL of this page
https://metraipolis.com/documento/dc_666135596a67
How to cite
Extremal permutations of $\mathbb{Z}_n$ with many good slopes and applications to quantum Latin squares — arXiv:2611.01465 — arXiv (en), https://arxiv.org/abs/2611.01465 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_666135596a67 (Metraipolis archive dc_666135596a67, sha256 9151617d28d4f3503058391c02036fa656e74cb2942ac47ed17f1e083de300e1)
BibTeX
@misc{dc666135596a67,
title = {Extremal permutations of $mathbbZ_n$ with many good slopes and applications to quantum Latin squares — arXiv:2611.01465},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01465},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_666135596a67; sha256 9151617d28d4f3503058391c02036fa656e74cb2942ac47ed17f1e083de300e1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01465. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For $n\ge2$, a good slope of a permutation $f$ of $\mathbb{Z}_n=\mathbb{Z}/n\mathbb{Z}$ is an element $m\in\mathbb{Z}_n$ for which $x\mapsto f(x)+mx$ is a permutation. We prove the sharp upper bound $\varphi(n)$ on the number of good slopes, where $\varphi$ is Euler's totient function. We classify and count the equality cases for prime powers and products of two distinct odd primes. Non-affine equality cases exist for every composite $n\ge6$. We also prove the sharp bound $p_0-1$ for the size of a set of good slopes with invertible differences between distinct elements, where $p_0$ is the least prime divisor of $n$. Finally, we establish gap results below $\varphi(n)$ and apply our bounds to a construction of quantum Latin squares due to Ball and Simoens.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01465 — 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-11-03T18:15:38.071Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).