Related papers: Special matchings in Coxeter groups
Statistical matching methods are widely used in the social and health sciences to estimate causal effects using observational data. Often the objective is to find comparable groups with similar covariate distributions in a dataset, with the…
We establish simple combinatorial descriptions of the radical and irreducible representations specifically for the descent algebra of a Coxeter group of type $D$ over any field.
In this article, we study the \'etale cohomology of the compactification of Deligne-Lusztig varieties associated to a Coxeter element. We prove a result for the integral coefficients in the case of general linear group $GL_d$, and we…
Isotopic pairs and their representations are considered in a general framework of the vector superalgebra. Numerous examples of finite-dimensional and infinite-dimensional isotopic pairs are discussed. Several types of their representations…
The goal of this note is to give a geometric interpretation of a theorem of Brenti that calculates Kazhdan-Lusztig polynomials associated to Coxeter groups, if the Coxeter group is isomorphic to a Weyl group. ----- Le but de cette note est…
Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the…
In this note we make a universal construction of Bruhat-Tits group scheme on wonderful embeddings of adjoint groups in the absolute and relative settings and of adjoint Kac-Moody groups. These have natural classifying properties reflecting…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…
In this paper, we study $k$-parabolic arrangements, a generalization of $k$-equal arrangements for finite real reflection groups. When $k=2$, these arrangements correspond to the well-studied Coxeter arrangements. Brieskorn (1971) showed…
Let (\Pi,\Sigma) be a Coxeter system. An ordered list of elements in \Sigma and an element in \Pi determine a {\em subword complex}, as introduced in our paper on Gr\"obner geometry of Schubert polynomials (math.AG/0110058). Subword…
In this paper, we study the double shortcuts associated with pairs of standard hypercube decompositions of arbitrary Bruhat intervals in the symmetric group. Our results imply that a conjecture stated in [Bull. London Math. Soc., 57 (2025),…
In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…
Kazhdan and Lusztig define, for an arbitrary Coxeter system $(W,S)$, a family of polynomials indexed by pairs of elements of $W$. Despite their relevance and elementary definition, the explicit computation of these polynomials is still one…
As a sequel to our recent work on Casselman--Shahidi's holomorphicity conjecture on half-normalized intertwining operators for quasi-split classical groups, we modify our method, based on a lemma of Heiermann--Opdam, to prove certain cases…
We describe new combinatorial methods for constructing an explicit free resolution of Z by ZG-modules when G is a group of fractions of a monoid where enough least common multiples exist (``locally Gaussian monoid''), and, therefore, for…
We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…
We introduce Lehmer codes, with immersions in the Bruhat order, for several finite Coxeter groups, including all the classical Weyl groups. This allows to associate to each lower Bruhat interval of these groups a multicomplex whose…