Reflection Labels Establish Shellability for Shifted Lower Bruhat Intervals

Bruhat order organizes many constructions in algebraic combinatorics and geometry, but translating a Bruhat interval by a group element changes its order-theoretic behavior. The resulting shifted interval $[w_1,w_2]x^{-1}$ is ordered using the ambient Bruhat order, rather than by a transported copy of the original interval. The authors focus on the lower case $[e,w]x^{-1}$ and prove that it nevertheless admits an EL-labeling for every Coxeter group.

Core Contribution

The paper establishes that every shifted lower Bruhat interval $[e,w]x^{-1}$ is EL-shellable. This is a stronger structural statement than merely identifying its extremal elements or showing that it is graded: it supplies a labeling of cover relations for which intervals have a distinguished increasing maximal chain and a lexicographic ordering of chains.

The scope matters. Shifted Bruhat intervals arise from affine pavings of Richardson varieties, yet the paper emphasizes that they are generally neither twisted intervals nor tilted Bruhat intervals. Existing shellability results for those better-known variants therefore do not simply transfer. The contribution is an argument tailored to the shifted lower setting rather than a relabeling of a familiar interval class.

Technical Approach

Each cover in a shifted lower interval receives an explicit label given by a reflection. The proof uses these labels to control saturated chains in the Bruhat-induced order on the translate. The central task is to show that this reflection data meets the EL-shellability criterion, despite the fact that right translation by $x^{-1}$ does not preserve the ordinary interval structure in the way required by more standard Bruhat-order arguments.

The authors first establish the basic shape of the poset. They show that $[e,w]x^{-1}$ is graded and has a unique maximum, described by the Demazure product. They also introduce an opposite Demazure operator and prove that it gives the unique minimum. These extremal descriptions make the shifted interval tractable as a bounded graded object, while the reflection labeling supplies the more refined chain-level structure needed for shellability.

This division of labor is useful. The Demazure product identifies how multiplication and order combine at the top of the translate; the opposite operator performs the corresponding role at the bottom. The labeling theorem then concerns the internal route between those endpoints. Rather than treating shifted intervals as a small perturbation of ordinary Bruhat intervals, the paper builds the order theory around operations that remain meaningful after the shift.

Results and Analysis

The main theorem covers arbitrary Coxeter groups, not a finite or crystallographic subclass. It yields three directly stated structural facts for every shifted lower interval: gradedness, one unique maximum, and one unique minimum, followed by an explicit EL-labeling of its covers. The latter is the substantive result, since it turns a poset defined by an ambient order after translation into an object with a canonical combinatorial organization of its maximal chains.

There are no numerical experiments, benchmark comparisons, or computational scaling results here; the evidence is mathematical. The relevant standard is therefore whether the construction and proof address the full claimed domain. On the information provided, the theorem is broad in scope and its mechanism is concrete: covers are labeled by reflections rather than by an existence argument that leaves the labeling unspecified.

The paper’s value is mainly to researchers using Bruhat order in the combinatorics and geometry around Richardson varieties. It gives them a shellability result for a class that is motivated geometrically but does not fit the most immediate pre-existing interval families. The result should be read as a structural extension, not as a replacement for twisted or tilted interval theory: the paper explicitly distinguishes shifted intervals from both. Its practical consequence is a usable order-theoretic framework for analyzing these lower translated intervals, with the Demazure and opposite Demazure operations identifying their two endpoints.

Caveats

The theorem concerns shifted lower intervals of the form $[e,w]x^{-1}$. The abstract does not claim EL-shellability for an arbitrary shifted interval $[w_1,w_2]x^{-1}$, so extending the conclusion from lower intervals to the full shifted family would be unsupported. Likewise, the paper provides a formal combinatorial result rather than an empirical study; its evidence does not address algorithmic cost, implementations, or computational behavior on large Coxeter systems.