Prism permutations in the Bruhat order

Abstract

The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism permutations equivalently in terms of their reduced words and in terms of pattern containment. As part of this work, we introduce the notion of "calibration" to permutation patterns.