Related papers: Noncrossing partitions and Bruhat order

In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing…

We show that any lower Bruhat interval in a Coxeter group is a disjoint union of certain two-sided cosets as a consequence of Lifting Property and Subword Property. Furthermore, we describe these details in terms of Bruhat graphs, graded…

If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…

The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…

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…

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…

I introduce a method to generate families of CSS codes with interesting code parameters. The object of study is Coxeter groups, both finite and infinite (reducible or not), and a geometrically motivated partial order of Coxeter group…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite…

Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter…

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…

The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…

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…

In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

In this article we prove that the lattice of noncrossing partitions is EL-shellable when associated with the well-generated complex reflection group of type $G(d,d,n)$, for $d,n\geq 3$, or with the exceptional well-generated complex…

Noncrossing partition posets in a Coxeter group $W$ can fail to be lattices when $W$ is not finite. When the lattice property fails for $W$ of affine type, McCammond and Sulway's construction provides a larger lattice that contains the…

Let $\mathcal{L}$ be the noncrossing partition lattice associated to a finite Coxeter group $W$. In this paper we construct explicit bases for the top homology groups of intervals and rank-selected subposets of $\mathcal{L}$. We define a…