Enumerating coprime permutations

From MaRDI portal
(Redirected from Publication:6074974)



Abstract: Define a permutation sigma to be coprime if gcd(m,sigma(m))=1 for min[n]. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on [n] is n!cdot(c+o(1))n where [c = prod_{p ext{ prime }}frac{(p-1)^{2(1-1/p)}}{pcdot (p-2)^{(1-2/p)}}.] The techniques involve entropy maximization for the upper bound, and a mixture of number-theoretic bounds, permanent estimates, and the absorbing method for the lower bound.













This page was built for publication: Enumerating coprime permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074974)