1

From Bruhat intervals to intersection lattices and a conjecture of Postnikov

ptobgp9qiccl
We prove the conjecture of A. Postnikov that ($\mathrm{A}$) the number of regions in the inversion hyperplane arrangement associated with a permutation $w \in \mathfrak{S}_n$ is at most the number of elements below $w$ in the Bruhat order. and ($\mathrm{B}$) that equality holds if and only if $w$ avoids the patterns $4231$. $35142$. https://fitnessgravesyardes.shop/product-category/dc-power/
Report this page

Comments

    HTML is allowed

Who Upvoted this Story