Global patterns in signed permutations
Abstract
Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, with both characterizing and enumerative results. Surprisingly, many properties of signed permutations may be characterized by avoidance of the same set of patterns as the corresponding properties in the symmetric group. We also extend previous enumerative work of Egge, and our work has connections to the Garfinkle--Barbasch--Vogan correspondence, the Erdos--Szekeres theorem, and well-known integer sequences.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.