Related papers: Kazhdan--Lusztig polynomials for maximally-cluster…

Let $\mathfrak{g}$ be a finite dimensional complex simple Lie algebra, $\mathbb{K}$ a commutative field and $q$ a nonzero element of $\mathbb{K}$ which is not a root of unity. To each reduced decomposition of the longest element $w_0$ of…

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…

We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…

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…

Let $\mathfrak S_{[i,j]}$ be the subgroup of the symmetric group $\mathfrak S_n$ generated by adjacent transpositions $(i,i+1), \dotsc, (j-1,j)$, assuming $1 \leq i < j \leq n$. We give a combinatorial rule for evaluating induced sign…

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally…

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…

We define sets of orthogonal polynomials satisfying the additional constraint of a vanishing average. These are of interest, for example, for the study of the Hohenberg-Kohn functional for electronic or nucleonic densities and for the study…

Determining the appropriate number of clusters in unsupervised learning is a central problem in statistics and data science. Traditional validity indices such as Calinski-Harabasz, Silhouette, and Davies-Bouldin-depend on centroid-based…

The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…

In a preceding paper the theory of nonsymmetric Macdonald polynomials taking values in modules of the Hecke algebra of type $A$ (Dunkl and Luque SLC 2012) was applied to such modules consisting of polynomials in anti-commuting variables, to…

We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers $i,j,k$, the sizes of the alphabets over which a pattern $x \pi ^ {i} (x) \pi^{j}(x)…

Higher dimensional permutations are tuples of d-1 permutations that can be identified with a point set in a d-dimensional grid. In N. Bonichon and P.-J. Morel, {\it J. Integer Sequences} 25 (2022), several conjectures regarding the…

The combinatorial invariance conjecture (due independently to G. Lusztig and M. Dyer) predicts that if $[x,y]$ and $[x',y']$ are isomorphic Bruhat posets (of possibly different Coxeter systems), then the corresponding Kazhdan-Lusztig…

We reprove the surjectivity statement of Braverman-Kazhdan's spectral description of Lusztig's asymptotic Hecke algebra $J$ in the context of $p$-adic groups. The proof is based on Bezrukavnikov-Ostrik's description of $J$ in terms of…

Let G be a symplectic or orthogonal complex Lie group with Lie algebra g. As a G-module, the decomposition of the symmetric algebra S(g) into its irreducible components can be explicitely obtained by using identities due to Littlewood. We…

Using resolutions of singularities introduced by Cortez and a method for calculating Kazhdan-Lusztig polynomials due to Polo, we prove the conjecture of Billey and Braden characterizing permutations w with Kazhdan-Lusztig polynomial…

We prove that for any dimension function $h$ with $h \prec x^d$ and for any countable set of linear patterns, there exists a compact set $E$ with $\mathcal{H}^h(E)>0$ avoiding all the given patterns. We also give several applications and…

We provide simple rules for the computation of Kazhdan--Lusztig polynomials in the maximal parabolic case. They are obtained by filling regions delimited by paths with "Dyck strips" obeying certain rules. We compare our results with those…