A d-dimensional permutation of order n is an n-by-n-by
Statement
Linal/Luria: A d-dimensional permutation of order n is an n-by-n-by-...-by-n (d+1)-dimensional array of zeroes and ones, with the property that every row, column, etc., has exactly one 1 in it. (More precisely, if the array entries are A(j_(1)j_(2)j_(3)...j_(d+1)), for each k in [d+1] and t in [n], there is exactly one choice of all coordinates j_(i) except i=k so that setting j_(i)=k makes A(j_(1)j_(2)j_(3)...j_(d+1))=1.) Let P(n,d) be the number of d-dimensional permutations of order n. Linial and Luria showed that P(n,d) < ((1+o(1))n/e^(d))^n^(d). Is this tight, i.e., is P(n,d) > ((1+o(1))n/e^(d))^n^(d )also true? If so, this would be a very satisfying generalization of Stirling's formula and well-known bounds on the number of Latin squares (which are 2-dimensional permutations in disguise). See this.
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.