English
Related papers

Related papers: The intermediate orders of a Coxeter group

200 papers

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…

Group Theory · Mathematics 2010-02-01 Brent Everitt , John Fountain

For each positive integer $k$ we present an example of Coxeter system $(G_k,S_k)$ such that $G_k$ is a word-hyperbolic Coxeter group, for any two generating reflections $s,t\in S_k$ the product $st$ has finite order, and the Coxeter graph…

Group Theory · Mathematics 2007-05-23 Anna Felikson , Pavel Tumarkin

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

Combinatorics · Mathematics 2024-10-29 Paolo Sentinelli

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

Special matchings are purely combinatorial objects associated with a partially ordered set, which have applications in Coxeter group theory. We provide an explicit characterization and a complete classification of all special matchings of…

Combinatorics · Mathematics 2016-12-13 Fabrizio Caselli , Mario Marietti

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

We study the partial orders induced on Wachs and signed Wachs permutations by the Bruhat and weak orders of the symmetric and hyperoctahedral groups. We show that these orders are graded, determine their rank function, characterize their…

Combinatorics · Mathematics 2022-12-12 Francesco Brenti , Paolo Sentinelli

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

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

In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group. We then use this result to demonstrate several…

Group Theory · Mathematics 2010-07-23 Ryan Blair , Ryan Ottman

We study the poset of Borel congruence classes of symmetric matrices ordered by containment of closures. We give a combinatorial description of this poset and calculate its rank function. We discuss the relation between this poset and the…

Combinatorics · Mathematics 2009-12-10 Eli Bagno , Yonah Cherniavsky

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

Let (W,S) be a crystallographic Coxeter group (this includes all finite and affine Weyl groups), and J a subset of S. Let $W^J$ denote the set of minimal coset representatives modulo the parabolic subgroup $W_J$. For w in $W^J$, let…

Combinatorics · Mathematics 2008-05-01 Anders Bjorner , Torsten Ekedahl

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

Combinatorics · Mathematics 2025-09-03 Grant Barkley , Colin Defant , Patricia Hersh , Jon McCammond , Thomas McConville , David E Speyer

We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

Combinatorics · Mathematics 2023-11-14 Joël Gay , Vincent Pilaud

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

Let G be a quasi simple algebraic group over an algebraically closed field k whose characteristic is not very bad for G, and let B be a Borel subgroup of G with Lie algebra b. Given a B-stable abelian subalgebra a of the nilradical of b, we…

Algebraic Geometry · Mathematics 2024-08-05 Jacopo Gandini , Andrea Maffei , Pierluigi Moseneder Frajria , Paolo Papi

The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…

Group Theory · Mathematics 2025-02-25 Robert Nicolaides , Peter Rowley

We introduce stable reflection length in Coxeter groups, as a way to study the asymptotic behaviour of reflection length. This creates connections to other well-studied stable length functions in groups, namely stable commutator length and…

Group Theory · Mathematics 2025-04-02 Francesco Fournier-Facio , Marco Lotz , Timothée Marquis

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