A decomposition of \(\text{Fl}(n)^d\) indexed by permutation arrays (Q1585503)

This sequel to ``A combinatorial theory of higher-dimensional permutation arrays'' [Adv. Appl. Math. 25, No. 2, 194-211 (2000; Zbl 0957.05110 above)] describes the relative position for more than two flags by use of permutation arrays, or equivalently a decomposition of the product manifold indexed by such arrays. Two partial orders are also defined, one on all permutation arrays, and one on those arrays realized by flags. It is seen that in specific cases these coincide to yield the Bruhat order, or a poset isomorphic to the partition lattice. However, many open questions are also posed, the most prevalent being whether every permutation array can be realized by flags. This difficult conjecture has only been confirmed in a few cases, but since no counterexamples have been found to date, there is hope.