Related papers: On the weak order of Coxeter groups
We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…
A diagram obtained from the Carter diagram $\Gamma$ by adding one root together with its bonds such that the resulting subset of roots is linearly independent is said to be the {\it linkage diagram}. Given a linkage diagram, we associate…
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.…
We prove that the category of preordered groups contains two full reflective subcategories that give rise to some interesting Galois theories. The first one is the category of the so-called commutative objects, which are precisely the…
We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…
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…
Oshima's Lemma describes the orbits of parabolic subgroups of irreducible finite Weyl groups on crystallographic root systems. This note generalises that result to all root systems of finite Coxeter groups, and provides a self contained…
For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…
In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…
In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…
The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a…
We attach to every Coxeter system (W,S) an extension C_W of the corresponding Iwahori-Hecke algebra. We construct a 1-parameter family of (generically surjective) morphisms from the group algebra of the corresponding Artin group onto C_W.…
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…
Using the geometry of the associated Calogero-Moser space, R. Rouquier and the author have attached to any finite complex reflection group $W$ several notions (Calogero-Moser left, right or two-sided cells, Calogero-Moser cellular…
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…
We prove that linear extensions of the Bruhat order of a matroid are shelling orders and that the barycentric subdivision of a matroid is a Coxeter matroid, viewing barycentric subdivisions as subsets of a parabolic quotient of a symmetric…
Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…