2015/07/10 by John Engbers, Engbers, John, Adam Hammett +1
Mathematics · #06A07 #20B30 #20F55 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:06A07 #msc:20B30 #msc:20F55
paper · pdf · doi:10.48550/arxiv.1507.02983
36 pages. This version is a significant edit and extension of the previous version. It includes a new title, a computation of the Mobius function, and a probabilistic study of the poset. This version to appear in the Australasian Journal of Combinatorics
arxiv created 2018/03/01 · arxiv updated 2018/03/02
Let \mathfrakSn and \mathfrakBn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n, and let (\mathfrakSn,≤) denote the Bruhat ordering permutation poset. We study the restricted poset (\mathfrakBn,≤), first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the number of maximal elements below r fixed elements. It also quickly produces formulas for β(ω) (α(ω) respectively), the number of BG permutations weakly below (weakly above respectively) a fixed ω∈\mathfrakBn, and is used to compute the Möbius function on any interval in \mathfrakBn. We then turn to a probabilistic study of β=β(ω) (α=α(ω) respectively) for the uniformly random ω∈\mathfrakBn. We show that α and β are equidistributed, and that β is of the same order as its expectation with high probability, but fails to concentrate about its mean. This latter fact derives from the limiting distribution of β/n3. We also compute the probability that randomly chosen BG permutations form a 2- or 3-element multichain.