A decomposition of Fl(n)^d indexed by permutation arrays
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.
- Decompositions of permutations of \(\mathbb N\) with respect to divergent permutations
- scientific article; zbMATH DE number 1253971
- scientific article; zbMATH DE number 474585
- The Schubert calculus of decomposable permutations
- Block decomposition of permutations and Schur-positivity
- On components of vectorial permutations of \(\mathbb{F}_q^n\)
- Decomposition of permutations in a finite field
- Extending Comtet's decomposability of integer permutations
- A combinatorial theory of higher-dimensional permutation arrays
- Canonical decompositions of affine permutations, affine codes, and split \(k\)-Schur functions
This page was built for publication: A decomposition of \(\text{Fl}(n)^d\) indexed by permutation arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585503)
