Parking functions, Fubini rankings, and Boolean intervals in the weak order of Sn
Abstract
Let Sn denote the symmetric group and let W(Sn) denote the weak order of Sn. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a complete characterization and enumeration for the total number of Boolean intervals in W(Sn) and the total number of Boolean intervals of rank k in W(Sn). Furthermore, for any π∈Sn, we establish that the number of Boolean intervals in W(Sn) with minimal element π is a product of Fibonacci numbers. We conclude with some directions for further study.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.