A solution to one of Knuth's permutation problems
From MaRDI portal
Publication:990192
DOI10.1016/J.CRMA.2010.05.005zbMATH Open1231.05004arXiv1004.4159OpenAlexW2088564048MaRDI QIDQ990192FDOQ990192
Authors: Benjamin Young
Publication date: 6 September 2010
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1004.4159
Recommendations
Cites Work
Cited In (8)
- Solving a permutation problem by a fully polynomial-time approximation scheme
- Symbolic solution of certain problems in permutations
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
- Solving a family of permutation problems on 0-1 matrices
- Title not available (Why is that?)
- A solution of the Steinhaus's combinatorial problem
- Exploring the median of permutations problem
- The advantage of truncated permutations
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)