Metraipolis › archive › dc_b56183cdc6f7
Good slopes, congruence preservation, and gaps over residue rings — arXiv:2611.04551
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04551
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:48:47.697Z
- SHA-256 of the archived text
fba7ff55dd7b2406ded274a690d159276240471d10aa7ef13f26c6b9265fcf14- Stable URL of this page
https://metraipolis.com/documento/dc_b56183cdc6f7
How to cite
Good slopes, congruence preservation, and gaps over residue rings — arXiv:2611.04551 — arXiv (en), https://arxiv.org/abs/2611.04551 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b56183cdc6f7 (Metraipolis archive dc_b56183cdc6f7, sha256 fba7ff55dd7b2406ded274a690d159276240471d10aa7ef13f26c6b9265fcf14)
BibTeX
@misc{dcb56183cdc6f7,
title = {Good slopes, congruence preservation, and gaps over residue rings — arXiv:2611.04551},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04551},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b56183cdc6f7; sha256 fba7ff55dd7b2406ded274a690d159276240471d10aa7ef13f26c6b9265fcf14},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04551. 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 call $f$ congruence-preserving if it preserves congruences modulo every divisor of $n$. For odd prime powers $n$, we classify all permutations with more than $n/2$ good slopes. Among permutations that are not congruence-preserving, we determine the maximum number of good slopes for $n=3^e$ with $e\ge2$, and for $n=25$, $125$ and $625$. Every permutation of $\mathbb{Z}_n$ has at most $\varphi(n)$ good slopes, where $\varphi$ is Euler's totient function. For several families of moduli with at least two distinct prime divisors, we prove a sharp upper bound for the number of good slopes of the permutations with fewer than $\varphi(n)$ good slopes. These families include $9q$ and $3q^e$ for every prime $q\ge5$ and every $e\ge1$. Together with a companion paper, this settles the bound for every odd composite modulus below $105$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2611.04551 — 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-04T12:32:32.031Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).