Related papers: Kazhdan--Lusztig polynomials for maximally-cluster…
This paper contains the decomposition matrices for blocks of defect at most $2$ in Category $\mathcal{O}_c(W)$ of the rational Cherednik algebra when $W=E_8$ or $F_4$ with equal parameters $c=1/d$, $d>2$ a regular number of $W$. A corollary…
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…
The study of pattern avoidance in linear permutations has been an active area of research for almost half a century now, starting with the work of Knuth in 1973. More recently, the question of pattern avoidance in circular permutations has…
Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…
For extra-large Coxeter systems (m(s,r)>3), we construct a natural and explicit set of Soergel bimodules D={D_w}_{w\in W} such that each D_w contains as a direct summand (or is equal to) the indecomposable Soergel bimodule B_w. When…
This paper discusses various aspects of the Hecke algebra combinatorics that are related to conditions appearing in K{\aa}hrstr{\"o}m's conjecture that addresses Kostant's problem for simple highest weight modules in the…
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…
Identifying a set of homogeneous clusters in a heterogeneous dataset is one of the most important classes of problems in statistical modeling. In the realm of unsupervised partitional clustering, k-means is a very important algorithm for…
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute…
Parallel to the very rich theory of Kazhdan-Lusztig cells in characteristic $0$, we try to build a similar theory in positive characteristic. We study cells with respect to the $p$-canonical basis of the Hecke algebra of a crystallographic…
We show a precise formula, in the form of a monomial, for certain families of parabolic Kazhdan-Lusztig polynomials of the symmetric group. The proof stems from results of Lapid-Minguez on irreducibility of products in the…
We consider maximal non-$l$-intertwining collections, which are a higher-dimensional version of the maximal non-crossing collections which give clusters of Pl\"ucker coordinates in the Grassmannian coordinate ring, as described by Scott. We…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…
The affine Hecke algebra of type $A$ has two parameters $\left( q,t\right) $ and acts on polynomials in $N$ variables. There are two important pairwise commuting sets of elements in the algebra: the Cherednik operators and the Jucys-Murphy…
A permutation is called covexillary if it avoids the pattern $3412$. We construct an open embedding of a covexillary matrix Schubert variety into a Grassmannian Schubert variety. As applications of this embedding, we show that the…
This paper is a report on a computer check of some positivity properties of the Hecke algebra in type H4, including the non-negativity of the coefficients of the structure constants in the Kazhdan-Lusztig basis. This answers a long-standing…
We show that the elements of the Kazhdan--Lusztig basis of the spherical Hecke algebra of type $G_2$ have an atomic decomposition. As a by-product, we obtain a new algorithm to compute generalized Kostka--Foulkes polynomials in type $G_2$.
In this thesis, we introduced and carried out a combinatorial study of permutations that avoid one or two patterns of length 3 according to the statistic number of crossings. For this purpose, we manipulated a bijection of Elizalde and Pak…
Recently, Lusztig constructed for each reductive group a partition by unions of sheets of conjugacy classes, which is indexed by a subset of the set of conjugacy classes in the associated Weyl group. Sevostyanov subsequently used certain…