ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C(n)C(n) denote the number of permutations csigmacsigma of [n][n] such that cgcd(j,csigma(j))=1cgcd(j,csigma(j))=1 for every jcin[n]jcin[n]. After defining constants ckc_k for the corresponding restrictions modulo k!k! and setting c0=climkctocinftyckc_0=clim_{kctocinfty}c_k, the asymptotic conjecture for coprime permutations.

C(n)=n!(c0+o(1))nas n→∞.C(n)=\frac{n!}{(c_0+o(1))^n}\quad\text{as }n\to\infty.

The constants ckc_k arise from optimizing the limiting proportions of permitted transitions between classes determined by common divisors with the product of the primes up to kk. The claim would identify the exponential-order asymptotic for coprime permutations, but no resolution is supplied here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.