A bimodule description of the Hecke category

For a Coxeter system and a representation $V$ of this Coxeter system, Soergel defined a category which is now called the category of Soergel bimodules and proved that this gives a categorification of the Hecke algebra when $V$ is reflection faithful. Elias and Williamson defined another category when $V$ is not reflection faithful and proved that this category is equivalent to the category of Soergel bimodules when $V$ is reflection faithful. Moreover, they proved the categorification theorem for their category with fewer assumptions on $V$ . In this paper, we give a bimodule description of the Elias–Williamson category and re-prove the categorification theorem.

Cataland: Why the Fuss?

International audience The main objects of noncrossing Catalan combinatorics associated to a finite Coxeter system are noncross- ing partitions, sortable elements, and cluster complexes. The first and the third of these have known Fuss–Catalan generalizations. We provide new viewpoints for these, introduce a corresponding generalization of sortable elements as elements in the positive Artin monoid, and show how this perspective ties together all three generalizations.

A two-sided analogue of the Coxeter complex

International audience For any Coxeter system (W, S) of rank n, we introduce an abstract boolean complex (simplicial poset) of dimension 2n − 1 which contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples (J,w,K), where J and K are subsets of the set S of simple generators, and w is a minimal length representative for the double parabolic coset WJ wWK . There is exactly one maximal face for each element of the group W . The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the h-polynomial is given by the “two-sided” W -Eulerian polynomial, i.e., the generating function for the joint distribution of left and right descents in W .

A Two-Sided Analogue of the Coxeter Complex

For any Coxeter system $(W,S)$ of rank $n$, we study an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. For finite $W$, this complex is first described in work of Hultman. Faces are indexed by triples $(I,w,J)$, where $I$ and $J$ are subsets of the set $S$ of simple generators, and $w$ is a minimal length representative for the parabolic double coset $W_I w W_J$. There is exactly one maximal face for each element of the group $W$. The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the $h$-polynomial is given by the "two-sided" $W$-Eulerian polynomial, i.e., the generating function for the joint distribution of left and right descents in $W$.

Parallel Residues

This chapter considers the notion of parallel residues in a building. It begins with the assumption that Δ‎ is a building of type Π‎, which is arbitrary except in a few places where it is explicitly assumed to be spherical. Δ‎ is not assumed to be thick. The chapter then elaborates on a hypothesis which states that S is the vertex set of Π‎, (W, S) is the corresponding Coxeter system, d is the W-distance function on the set of ordered pairs of chambers of Δ‎, and ℓ is the length function on (W, S). It also presents a notation in which the type of a residue R is denoted by Typ(R) and concludes with the condition that residues R and T of a building will be called parallel if R = projR(T) and T = projT(R).

Tits Indices

This chapter introduces the notion of a Tits index and the notion of the relative Coxeter diagram of a Tits index. It first defines a Tits index, which can be anisotropic or isotropic, quasi-split or split, before considering a number of propositions regarding compatible representations. It then gives a proof of the theorem that includes two assumptions about a Coxeter system, focusing on the absolute Coxeter system, the relative Coxeter system, and the relative Coxeter group of the Tits index, as well as the absolute Coxeter diagram (or absolute type), the relative Coxeter diagram (or relative type), and the absolute rank and the relative rank of the Tits index. The chapter concludes with some observations about the case that (W, S) is spherical, irreducible or affine.

Fixed Point Buildings

This chapter presents the proof for the Fundamental Theorem of Descent in buildings: that if Γ‎ is a descent group, the set of residues of a building Δ‎ that are stabilized by a subgroup Γ‎ of Aut(Γ‎) forms a thick building. It begins with the hypothesis: Let Π‎ be an arbitrary Coxeter diagram, let S be the vertex set of Π‎ and let (W, S) be the corresponding Coxeter system. It then defines a Γ‎-residue and a Γ‎-chamber as well as a descent group of Δ‎ before concluding with the main result about the fixed point building of Γ‎.

Alignments, crossings, cycles, inversions, and weak Bruhat order in permutation tableaux of type $B$

International audience Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation tableaux of type $B$, and the cycles of signed permutations are understood in the corresponding bare tableaux of type $B$. We find the relation between the number of alignments, crossings and other statistics of signed permutations, and also characterize the covering relation in weak Bruhat order on Coxeter system of type $B$ in terms of permutation tableaux of type $B$. De nombreuses statistiques importantes des permutations signées sont réalisées dans les tableaux de permutations ou ”bare” tableaux de type $B$ correspondants : les alignements, croisements et inversions des permutations signées sont réalisés dans les tableaux de permutations de type $B$ correspondants, et les cycles des permutations signées sont comprises dans les ”bare” tableaux de type $B$ correspondants. Cela nous mène à relier le nombre d’alignements et de croisements avec d’autres statistiques des permutations signées, et aussi de caractériser la relation de couverture dans l’ordre de Bruhat faible sur des systèmes de Coxeter de type $B$ en termes de tableaux de permutations de type $B$.