A combinatorial theory of higher-dimensional permutation arrays
This charmingly written paper, packed with examples, introduces a \(d\)-dimensional generalization of permutation matrices, called permutation arrays, via the concept of totally rankable dot arrays. The rank array of permutation arrays is then characterized, and an algorithm for constructing permutation arrays is given. A lower bound for the number of permutation arrays is obtained from sparse arrays, while an upper bound for three-dimensional permutation arrays is found from the algorithm described earlier. However, specific formulas are found for the specializations of permutation arrays that correspond to permutations and set partitions. Finally it is observed that in these situations, a given partial order on permutation arrays yields a poset isomorphic to the Bruhat order on the symmetric group or the partition lattice on an \(n\)-set, respectively.
- Construction of a superimposed code using partitions
- Small matrices of large dimension
- A decomposition of \(\text{Fl}(n)^d\) indexed by permutation arrays
- Flag arrangements and triangulations of products of simplices
- Two Constructions of Permutation Arrays
- An Analysis of Permutations in Arrays
- An upper bound on the number of high-dimensional permutations
- scientific article; zbMATH DE number 7640030 (Why is no real title available?)
- Permutation matrices and beyond: an essay
- Extending permutation arrays: improving MOLS bounds
- Enumeration of factorizable multi-dimensional permutations
- Multiple contractions of permutation arrays
- Patterns in multi-dimensional permutations
This page was built for publication: A combinatorial theory of higher-dimensional permutation arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585504)
