Bruhat order

Bruhat order
Name	Bruhat order
Discipline	Mathematics
Field	Algebraic combinatorics; Representation theory; Algebraic geometry

Bruhat order is a partial order on elements of reflection groups arising in algebraic combinatorics, algebraic geometry, and representation theory. It organizes elements of symmetric groups, Coxeter groups, and Weyl groups and appears in the study of flag varieties, Schubert varieties, and Hecke algebras. The order underlies connections between combinatorial structures and geometric or representation-theoretic objects such as Schubert cells, Kazhdan–Lusztig polynomials, and Verma modules.

Definition and basic properties

The Bruhat order is defined on elements of a Coxeter group using reduced expressions and root reflections, and it satisfies properties analogous to those in the theory of Jordan–Hölder theorem, Weyl groups, Coxeter group theory and the structure of flag variety stratifications. It is graded by length functions related to the length in a Coxeter presentation and interacts with the Bruhat decomposition used in the study of Borel subgroup orbits in reductive Lie groups such as SL_n, GL_n, and Sp_2n. The order is compatible with multiplication by simple reflections, has the exchange property familiar from Matroid theory, and admits a duality reflecting longest elements like those in Dynkin diagram classifications (for example types A, B, C, D, E, F, G).

Bruhat order on Coxeter groups and Weyl groups

Within a Coxeter group the Bruhat order compares elements via subword containment in reduced expressions; in particular it is fundamental in the study of finite Weyl groups attached to root systems classified by Cartan matrix types associated to Dynkin diagrams including Type A_n, Type B_n, Type C_n, Type D_n, Type E_6, Type E_7, Type E_8, Type F_4, and Type G_2. For reductive algebraic groups over algebraically closed fields, the Bruhat order on the associated Weyl group indexes closures of Schubert varietys in flag varieties like those studied by Ehresmann, Bruhat, and Tits. The structure constants for multiplication in Hecke algebras respect the Bruhat order, and the order features in the formulation of the Kazhdan–Lusztig conjectures and their proofs by researchers connected to institutions such as Harvard University, Princeton University, and Institut des Hautes Études Scientifiques.

Combinatorial characterizations and covering relations

Combinatorial descriptions of the Bruhat order use inversions arrays, permutation matrices, and pattern containment studied in the context of Symmetric group combinatorics and Young tableau theory; classical criteria involve comparing inversion sets and rank conditions akin to those in Schubert calculus for Grassmannian varieties. Covering relations correspond to multiplication by reflections that increase length by one and are used to compute Hasse diagrams linked to Dynkin diagram operads or to analyze posets that appear in the work of authors affiliated with Cambridge University, University of Oxford, and University of Bonn. Techniques from Pipe dream combinatorics, RC-graphs and Bruhat graphs produce explicit descriptions and help enumerate chains relevant to Littlewood–Richardson rule computations and the study of Totally nonnegative matrices.

Geometric and representation-theoretic interpretations

Geometrically, Bruhat order encodes closure relations among Schubert cells in flag varieties for groups like GL_n and SO_n, and it governs incidence relations in moduli spaces that arise in studies related to Atiyah–Bott and Beilinson–Bernstein localization. Representation-theoretically, the order influences composition multiplicities in Verma modules, the structure of category O explored by Joseph Bernstein, Israel Gelfand, and Georges Lusztig, and character formulas such as those involving Kazhdan–Lusztig polynomials and Springer correspondence phenomena. Intersection cohomology of Schubert varieties, perverse sheaves studied at Max Planck Institute for Mathematics and Mathematical Sciences Research Institute, and equivariant K-theory computations reflect Bruhat combinatorics; connections extend to geometric representation theory frameworks from Beilinson–Drinfeld and applications in Langlands program contexts.

Examples and special cases

Classical examples include the Bruhat order on the Symmetric group S_n where it coincides with the closure order of permutation matrices in the full flag variety of GL_n and where rank conditions reduce to comparing positions described by Young diagram statistics. For Grassmannians and partial flag varieties one obtains the weak and strong orders related to Schubert calculus and to combinatorial objects like Young tableau and Plücker coordinates. Special cases tied to exceptional groups involve Weyl groups of E_6 and E_8 where computational challenges inspired work at centers such as CERN and Los Alamos National Laboratory on computer algebra approaches. Finite Coxeter groups of dihedral type yield tractable linear orders used in studies connected to Fomin–Zelevinsky cluster algebras.

Applications and connections

Applications of Bruhat order appear in enumerative geometry problems in Schubert calculus, in the computation of structure constants for Hecke algebras and Kac–Moody algebra representations, and in combinatorial representation theory related to the Robinson–Schensted correspondence and Plancherel measure analyses explored at institutions like Columbia University and Yale University. It connects to studies in total positivity pioneered by Lusztig and to algebraic combinatorics problems solved using tools from SageMath projects supported by academic consortia and by software developed at University of Washington. The Bruhat order also appears in algorithmic contexts for computing Bruhat intervals relevant to geometric modeling in computational algebra systems used by researchers at Institut Camille Jordan and in applications to mathematical physics in works associated with Princeton Plasma Physics Laboratory.

Category:Algebraic combinatorics