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/
From Bruhat intervals to intersection lattices and a conjecture of Postnikov
Internet 3 hours ago ptobgp9qicclWeb Directory Categories
Web Directory Search
New Site Listings