Smooth permutations and polynomials revisited

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Gorodetsky, Ofir
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866929661969170432
author Gorodetsky, Ofir
author_facet Gorodetsky, Ofir
contents 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 $ρ$ function, but with its argument shifted. We determine the order of magnitude of $\log(p_{n,m}/ρ(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 behavior at $m\approx (3/2)\log_q n$.
format Preprint
id arxiv_https___arxiv_org_abs_2211_11023
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Smooth permutations and polynomials revisited
Gorodetsky, Ofir
Combinatorics
Number Theory
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 $ρ$ function, but with its argument shifted. We determine the order of magnitude of $\log(p_{n,m}/ρ(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 behavior at $m\approx (3/2)\log_q n$.
title Smooth permutations and polynomials revisited
topic Combinatorics
Number Theory
url https://arxiv.org/abs/2211.11023