Hostname: page-component-6766d58669-h8lrw Total loading time: 0 Render date: 2026-05-18T13:55:50.872Z Has data issue: false hasContentIssue false

Smooth permutations and polynomials revisited

Published online by Cambridge University Press:  11 December 2024

OFIR GORODETSKY*
Affiliation:
Department of Mathematics, Technion - Israel Institute of Technology, Haifa, 3200003, Israel. e-mail: ofir.gor@technion.ac.il
Rights & Permissions [Opens in a new window]

Abstract

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The main term is the usual Dickman $\rho$ function, but with its argument shifted.

We determine the order of magnitude of $\log(p_{n,m}/\rho(n/m))$ where $p_{n,m}$ is the probability that a permutation on n elements, chosen uniformly at random, is m-smooth.

We uncover a phase transition in the polynomial setting: the probability that a polynomial of degree n in $\mathbb{F}_q$ is m-smooth changes its behaviour at $m\approx (3/2)\log_q n$.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Cambridge Philosophical Society