An upper bound on the number of high-dimensional permutations

Details An upper bound on the number of high-dimensional permutations An upper bound on the number of high-dimensional permutations

2011-06-03

arxiv.org/abs/1106.0649v1

Mathematics

Combinatorics

Scientific paper

What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and ones in which every "line" contains a unique 1 entry. A line here is a set of entries of the form {(x_1,...,x_{i-1},y,x_{i+1},...,x_{d+1})}, for y between 1 and n, some index i between 1 and d+1 and some choice of x_j in [n] for all j except i. It is easy to observe that a one-dimensional permutation is simply a permutation matrix and that a two-dimensional permutation is synonymous with an order-n Latin square. We seek an estimate for the number of d-dimensional permutations. Our main result is the following upper bound on their number: ((1+o(1))(n/e^d))^(n^d). We tend to believe that this is actually the correct number, but the problem of proving the complementary lower bound remains open. Our main tool is an adaptation of Bregman's proof of the Minc conjecture on permanents. More concretely, our approach is very close in spirit to Radhakrishnan's proof of Bregman's theorem.

Affiliated with

Also associated with

No associations

Rating

An upper bound on the number of high-dimensional permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An upper bound on the number of high-dimensional permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An upper bound on the number of high-dimensional permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223927