The Weak Bruhat Order and Separable Permutations
Fan Wei

TL;DR
This paper studies the rank generating functions of separable permutations within the weak Bruhat order, revealing a surprising product relation and establishing properties like rank-symmetry and unimodality of related posets.
Contribution
It introduces explicit formulas for rank generating functions of separable permutations in the weak Bruhat order and uncovers a novel product relation between these functions.
Findings
Product of generating functions equals the symmetric group's generating function.
Explicit formulas for rank generating functions are derived.
The posets are shown to be rank-symmetric and unimodal.
Abstract
In this paper we consider the rank generating function of a separable permutation in the weak Bruhat order on the two intervals and , where . We show a surprising result that the product of these two generating functions is the generating function for the symmetric group with the weak order. We then obtain explicit formulas for the rank generating functions on and , which leads to the rank-symmetry and unimodality of the two graded posets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
