A solution to one of Knuth's permutation problems
From MaRDI portal
Publication:990192
Abstract: We answer a problem posed recently by Knuth: an n-dimensional box, with edges lying on the positive coordinate axes and generic edge lengths W_1 < W_2 < ... < W_n, is dissected into n! pieces along the planes x_i = x_j. We describe which pieces have the same volume, and show that there are C_n distinct volumes, where C_n denotes the nth Catalan number.
Recommendations
Cites work
Cited in
(8)- A solution of the Steinhaus's combinatorial problem
- The advantage of truncated permutations
- Solving a permutation problem by a fully polynomial-time approximation scheme
- scientific article; zbMATH DE number 3559582 (Why is no real title available?)
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
- Exploring the median of permutations problem
- Symbolic solution of certain problems in permutations
- Solving a family of permutation problems on 0-1 matrices
This page was built for publication: A solution to one of Knuth's permutation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990192)