On comparability of bigrassmannian permutations

MaRDI QIDQ4616099zbMATH OpenFDO

Authors John Engbers, Adam Hammett

Publication date 30 January 2019

Full work available at URL https://arxiv.org/abs/1507.02983, http://ajc.maths.uq.edu.au/pdf/71/ajc_v71_p121.pdf

zbMATH Keywords

BG permutationsMöbius function

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: Let $mathfrak{S}_n$ and $mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(mathfrak{S}_n,leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset $(mathfrak{B}_n,leq)$, 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 $$ ($alpha(omega)$ respectively), the number of BG permutations weakly below (weakly above respectively) a fixed $omegainmathfrak{B}_n$, and is used to compute the M"obius function on any interval in $mathfrak{B}_n$. We then turn to a probabilistic study of $$ ($alpha=alpha(omega)$ respectively) for the uniformly random $omegainmathfrak{B}_n$. We show that $alpha$ 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 $$. We also compute the probability that randomly chosen BG permutations form a 2- or 3-element multichain.

Recommendations

• Partial vexillarity and bigrassmannian permutations
• On Comparability and Permutation Graphs
• scientific article; zbMATH DE number 4053621
• On the permutation complexity of the Cantor-like sequences
• An Erdős-Hajnal analogue for permutation classes
• Enumeration of bigrassmannian permutations below a permutation in Bruhat order
• On convergence and extensions of size-biased permutations
• On a refinement of Wilf-equivalence for permutations
• scientific article; zbMATH DE number 3964633

Cites work

• 3412, 4231 patterns produce singular points of essential sets.
• Alternating sign matrices and their Bruhat order
• An improved tableau criterion for Bruhat order
• Analytic combinatorics
• Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
• Bases for the Bruhat-Chevalley order on all finite Coxeter groups
• Bijection between bigrassmannian permutations maximal below a permutation and its essential set
• Combinatorics of Coxeter Groups
• Confirming two conjectures about the integer partitions
• Enumeration of bigrassmannian permutations below a permutation in Bruhat order
• How often are two permutations comparable?
• scientific article; zbMATH DE number 3955215 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1741012 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1380572 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• Minuscule elements of Weyl groups
• More combinatorics of Fulton's essential set
• On the fully commutative elements of Coxeter groups
• Order dimension, strong Bruhat order and lattice properties for posets
• Presenting the cohomology of a Schubert variety
• Proof of the alternating sign matrix conjecture
• Random set partitions: Asymptotics of subset counts
• Rings of sets
• Some characterizations of Bruhat ordering on a Coxeter group and determination of the relation Möbius function
• Sum of lengths of inversions in permutations
• The enumeration of fully commutative elements of Coxeter groups
• The Möbius function of factor order
• The Möbius function of generalized factor order
• The Möbius function of the consecutive pattern poset
• The Prism tableau model for Schubert polynomials
• Trivial meet and join within the lattice of monotone triangles.
• Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset

Cited in

(7)

• Weighted counting of inversions on alternating sign matrices
• Convex \((0, 1)\)-matrices and their epitopes
• Bigrassmannian permutations and Verma modules
• How often are two permutations comparable?
• scientific article; zbMATH DE number 3964633 (Why is no real title available?)
• Enumeration of bigrassmannian permutations below a permutation in Bruhat order
• Bijection between bigrassmannian permutations maximal below a permutation and its essential set

Describes a project that uses

Uses Software

• ROBBINS

This page was built for publication: On comparability of bigrassmannian permutations

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