ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers dd and nn, let Sd,nS_{d,n} denote the set of dd-dimensional permutations of order nn: equivalently, the [n]d[n]^d arrays with entries in [n][n] in which every line contains each element of [n][n] exactly once. Thus ∣Sd,n∣|S_{d,n}| is the number of dd-dimensional permutations of order nn.

Asymptotic enumeration conjecture.

∣Sd,n∣=((1+o(1))ned)nd.|S_{d,n}|=\left((1+o(1))\frac{n}{e^d}\right)^{n^d}.

For d=1d=1 this follows from Stirling's formula, and for d=2d=2 it is the known asymptotic estimate for Latin squares. The paper's main result gives the corresponding upper bound, while the complementary lower bound remains open; the displayed equality is therefore an open conjecture.

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.