Boolean intervals in the weak order of \mathfrak{S}_n

Authors Jennifer Elder, Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori

Publication date 26 June 2023

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics of partially ordered sets (06A07)

Abstract: Let

m a t h f r a k S_{n}

denote the symmetric group and let

W (m a t h f r a k S_{n})

denote the weak order of

m a t h f r a k S_{n}

. Through a surprising connection to a subset of parking functions, which we call emph{unit Fubini rankings}, we provide a complete characterization and enumeration for the total number of Boolean intervals in

W (m a t h f r a k S_{n})

and the total number of Boolean intervals of rank

k

in

W (m a t h f r a k S_{n})

. Furthermore, for any

p i i n m a t h f r a k S_{n}

, we establish that the number of Boolean intervals in

W (m a t h f r a k S_{n})

with minimal element

p i

is a product of Fibonacci numbers. We conclude with some directions for further study.

This page was built for publication: Boolean intervals in the weak order of $\mathfrak{S}_n$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441529)