English
Related papers

Related papers: From Bruhat intervals to intersection lattices and…

200 papers

For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…

Combinatorics · Mathematics 2020-06-16 Neil J. Y. Fan

Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane…

Combinatorics · Mathematics 2010-10-05 Axel Hultman

There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…

Combinatorics · Mathematics 2015-10-21 Joel Brewster Lewis , Alejandro H. Morales

We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are…

Combinatorics · Mathematics 2012-07-24 Axel Hultman , Kathrin Vorwerk

Hyperplane arrangements dissect $\mathbb{R}^n$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as a sum of nonnegative integers called Whitney numbers of the first kind. His theorem…

Combinatorics · Mathematics 2020-09-28 Galen Dorpalen-Barry , Jang Soo Kim , Victor Reiner

The classical permutohedron Perm is the convex hull of the points (w(1),...,w(n)) in R^n where w ranges over all permutations in the symmetric group. This polytope has many beautiful properties -- for example it provides a way to visualize…

Combinatorics · Mathematics 2015-01-06 Lauren K. Williams

Hultman, Linusson, Shareshian, and Sj\"ostrand gave a pattern avoidance characterization of the permutations for which the number of chambers of its associated inversion arrangement is the same as the size of its lower interval in Bruhat…

Combinatorics · Mathematics 2017-10-19 Alexander Woo

We study the poset topology of lattices arising from orientations of 1-skeleta of directionally simple polytopes, with Bruhat interval polytopes $Q_{e,w}$ as our main example. We show that the order complex $\Delta ((u,v)_w)$ of an interval…

Combinatorics · Mathematics 2026-03-02 Christian Gaetz , Patricia Hersh

We study Bruhat intervals in affine Weyl groups by viewing them as regions of alcoves. In type $\widetilde{A}_2$ we show that each interval coincides with a generalized permutohedron minus a star-shaped polygon, and we prove a subtler…

Combinatorics · Mathematics 2025-07-21 Gaston Burrull , Nicolas Libedinsky , Rodrigo Villegas

In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related…

Combinatorics · Mathematics 2015-05-29 Bridget Eileen Tenner

We describe an algorithm which pattern embeds, in the sense of Woo-Yong, any Bruhat interval of a symmetric group into an interval whose extremes lie in the same right Kazhdan-Lusztig cell. This apparently harmless fact has applications in…

Representation Theory · Mathematics 2021-07-20 Martina Lanini , Peter J. McNamara

A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the…

Combinatorics · Mathematics 2023-02-28 Christian Gaetz , Ram K. Goel

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Probability · Mathematics 2007-05-23 Adam Hammett , Boris Pittel

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graszmannians in terms of certain sets of reflections in the corresponding Weyl group. The proof is…

Algebraic Geometry · Mathematics 2007-05-23 Christian Krattenthaler

Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…

Representation Theory · Mathematics 2015-08-14 Seth Shelley-Abrahamson , Suhas Vijaykumar

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

Combinatorics · Mathematics 2020-09-09 Bridget Eileen Tenner

The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering…

Combinatorics · Mathematics 2026-04-28 Sara Billey , Herman Chau , Kevin Liu

Let $W$ be a Coxeter group, and for $u,v\in W$, let $R_{u,v}(q)$ be the Kazhdan-Lusztig $R$-polynomial indexed by $u$ and $v$. In this paper, we present a combinatorial proof of the inversion formula on $R$-polynomials due to Kazhdan and…

We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…

Quantum Algebra · Mathematics 2018-08-29 K. R. Goodearl , M. T. Yakimov

An element $w$ of the Weyl group is called rationally smooth if the corresponding Schubert variety is rationally smooth. This happens exactly when the lower interval $[id,w]$ in the Bruhat order is palindromic. For each element $w$ of the…

Combinatorics · Mathematics 2019-04-26 Robert Mcalmon , Suho Oh , Hwanchul Yoo
‹ Prev 1 2 3 10 Next ›