English
Related papers

Related papers: On the weak order of Coxeter groups

200 papers

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…

Group Theory · Mathematics 2019-05-01 Barbara Baumeister , Patrick Wegener

We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for…

Combinatorics · Mathematics 2021-03-12 Bridget Eileen Tenner

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Combinatorics · Mathematics 2025-02-11 Grant T. Barkley

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

Combinatorics · Mathematics 2024-03-14 Ben Adenbaum , Jennifer Elder , Pamela E. Harris , J. Carlos Martínez Mori

We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak…

Combinatorics · Mathematics 2016-10-19 Patricia Hersh , Cristian Lenart

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By…

Combinatorics · Mathematics 2008-01-07 Christos A. Athanasiadis , Myrto Kallipoliti

Let $\mathrm{Mac}(W)$ be the MacNeille completion of the Bruhat order of a Coxeter group $W$. We introduce an action of the $0$-Hecke monoid of type $W$ on $\mathrm{Mac}(W)$, which allows us to define a weak order and a descent set…

Combinatorics · Mathematics 2026-05-11 Colin Defant

The Bruhat order on a Coxeter group is often described by examining subexpressions of a reduced expression. We prove that an analogous description applies to the Bruhat order on double cosets. This establishes the compatibility of the…

Combinatorics · Mathematics 2024-01-08 Ben Elias , Hankyung Ko , Nicolas Libedinsky , Leonardo Patimo

We revisit the structure of the normalizer $N_W(P)$ of a parabolic subgroup $P$ in a finite Coxeter group $W$, originally described by Howlett. Building on Howlett's Lemma, which provides canonical complements for reflection subgroups, and…

Group Theory · Mathematics 2026-03-30 J. Matthew Douglass , Götz Pfeiffer , Gerhard Roehrle

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons

Clans are combinatorial objects indexing the orbits of $GL(\mathbb{C}^p) \times GL(\mathbb{C}^q)$ on the variety of flags in $\mathbb{C}^{p+q}$. This geometry leads to a partial order on the set of clans analogous to weak Bruhat order on…

Combinatorics · Mathematics 2018-06-15 Brian Burks , Brendan Pawlowski

We show that the Coxeter-sortable elements in a finite Coxeter group W are the minimal congruence-class representatives of a lattice congruence of the weak order on W. We identify this congruence as the Cambrian congruence on W, so that the…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

Representation Theory · Mathematics 2023-03-14 Joseph Newton

We show that groups with a mild form of non-positive curvature (a navigable path system) satisfy the weak rank rigidity conjecture: they either have linear divergence or a Morse element. This class includes discrete groups of projective…

Group Theory · Mathematics 2026-05-29 Cornelia Drutu , Davide Spriano , Stefanie Zbinden

We provide a weaker version of the generalized lifting property which holds in complete generality for all finite Coxeter groups, and we use it to show that every parabolic Bruhat interval of a finite Coxeter group is a Coxeter matroid. We…

Combinatorics · Mathematics 2019-04-24 Fabrizio Caselli , Michele D'Adderio , Mario Marietti

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

We introduce a notion of a root groupoid as a replacement of the notion of Weyl group for (Kac-Moody) Lie superalgebras. The objects of the root groupoid classify certain root data, the arrows are defined by generators and relations. As an…

Representation Theory · Mathematics 2024-07-09 Maria Gorelik , Vladimir Hinich , Vera Serganova