English
Related papers

Related papers: On the shape of Bruhat intervals

200 papers

Weak Bruhat interval modules of the $0$-Hecke algebra in type $A$ provide a uniform approach to studying modules associated with noteworthy families of quasisymmetric functions. Recently this kind of modules were generalized from type $A$…

Representation Theory · Mathematics 2024-10-11 Han Yang , Houyi Yu

Let u and v be permutations on n letters, with u <= v in Bruhat order. A Bruhat interval polytope Q_{u,v} is the convex hull of all permutation vectors z = (z(1), z(2),...,z(n)) with u <= z <= v. Note that when u=e and v=w_0 are the…

Combinatorics · Mathematics 2015-06-11 Emmanuel Tsukerman , Lauren Williams

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Group Theory · Mathematics 2015-03-05 Van Minh Nguyen

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

We derive a formula for computing the size of lower Bruhat intervals for elements in the dominant cone of an affine Weyl group of type $A$. This enumeration problem is reduced to counting lattice points in certain polyhedra. Our main tool…

Combinatorics · Mathematics 2025-12-11 Federico Castillo , Damian de la Fuente , Nicolas Libedinsky , David Plaza

For two elements $v$ and $w$ of the symmetric group $\mathfrak{S}_n$ with $v\leq w$ in Bruhat order, the Bruhat interval polytope $Q_{v,w}$ is the convex hull of the points $(z(1),\ldots,z(n))\in \mathbb{R}^n$ with $v\leq z\leq w$. It is…

Combinatorics · Mathematics 2021-05-11 Eunjeong Lee , Mikiya Masuda , Seonjeong Park

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

Combinatorics · Mathematics 2022-06-28 Angela Carnevale , Matthew Dyer , Paolo Sentinelli

The normalizer $N_W(W_J)$ of a standard parabolic subgroup $W_J$ of a finite Coxeter group $W$ splits over the parabolic subgroup with complement $N_J$ consisting of certain minimal length coset representatives of $W_J$ in $W$. In this note…

Group Theory · Mathematics 2011-02-14 Matjaž Konvalinka , Götz Pfeiffer , Claas Röver

Let $\mathrm{Int}(n)$ denote the set of nonempty left weak Bruhat intervals in the symmetric group $\mathfrak{S}_n$. We investigate the equivalence relation $\overset{D}{\simeq}$ on $\mathrm{Int}(n)$, where $I \overset{D}{\simeq} J$ if and…

Combinatorics · Mathematics 2025-07-09 Seung-Il Choi , Sun-Young Nam , Young-Tak Oh

Let $W_a$ be an affine Weyl group and $\eta:W_a\longrightarrow W_0$ be the natural projection to the corresponding finite Weyl group. We say that $w\in W_a$ has finite Coxeter part if $\eta(w)$ is conjugate to a Coxeter element of $W_0$.…

Representation Theory · Mathematics 2012-03-22 Xuhua He , Zhongwei Yang

For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and…

Combinatorics · Mathematics 2016-07-04 T. Kyle Petersen

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

We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…

Combinatorics · Mathematics 2015-09-07 William Slofstra

We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…

Combinatorics · Mathematics 2007-05-23 Patricia Palacios , Maria Ronco

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

Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…

Quantum Algebra · Mathematics 2018-04-18 Christoph Bärligea

The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over Z[q] to a representation of…

Combinatorics · Mathematics 2010-08-06 Eric M. Rains , Monica J. Vazirani

We prove that the combinatorial concept of a special matching can be used to compute the parabolic Kazhdan-Lusztig polynomials of doubly laced Coxeter groups and of dihedral Coxeter groups. In particular, for this class of groups which…

Combinatorics · Mathematics 2016-11-07 Mario Marietti

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