The asymptotic enumeration conjecture for high-dimensional permutations
Statement
For positive integers and , let denote the set of -dimensional permutations of order : equivalently, the arrays with entries in in which every line contains each element of exactly once. Thus is the number of -dimensional permutations of order .
Asymptotic enumeration conjecture.
For this follows from Stirling's formula, and for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.