Related papers: Kazhdan--Lusztig polynomials for maximally-cluster…
We consider two families of polynomials that play the same role in the Temperley Lieb algebra of a Coxeter group as the Kazhdan Lusztig and R polynomials play in the Hecke algebra of the group. We study these polynomials from a…
There has been recent interest in lower bounds for the principal specializations of Schubert polynomials $\nu_w := \mathfrak S_w(1,\dots,1)$. We prove a conjecture of Yibo Gao in the setting of $1243$-avoiding permutations that gives a…
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the…
We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.
In this paper we show that the leading coefficient $\mu(y,w)$ of certain Kazhdan-Lusztig polynomials $P_{y,w}$ of the permutation group $\mathfrak S_n$ of 1,2,...,n are not greater than 1. More precisely, we show that the leading…
We prove that the multiplicities of certain maximal weights of $\mathfrak{g}(A^{(1)}_{n})$-modules are counted by pattern avoidance on words. This proves and generalizes a conjecture of Misra-Rebecca. We also prove similar phenomena in…
We show that parabolic Kazhdan-Lusztig polynomials of type $A$ compute the decomposition numbers in certain Harish-Chandra series of unipotent characters of finite groups of Lie types $B$, $C$ and $D$ over a field of non-defining…
Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…
We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\op_{n,k}(p)$ be the number of ordered set partitions of $\{1,2,\ldots,n\}$ into $k$ blocks that…
In this paper we compute the leading coefficients $\mu (u,w)$ of the Kazhdan-Lusztig polynomials $P_{u,w}$ for an affine Weyl group of type $\widetilde{A_2}$. We give all the values $\mu (u,w)$.
We investigate various connections between the 0-Hecke monoid, Catalan monoid, and pattern avoidance in permutations, providing new tools for approaching pattern avoidance in an algebraic framework. In particular, we characterize…
We construct new Yang-Baxter integrable boundary conditions in the lattice approach to the logarithmic minimal model WLM(1,p) giving rise to reducible yet indecomposable representations of rank 1 in the continuum scaling limit. We interpret…
We give an explicit combinatorial description of the irreducible components of the singular locus of the Schubert variety X_w for any element w in S_n. Our description of the irreducible components is computationally more efficient (O(n^6))…
We consider the problem of bounding the number of permutations $\sigma\in S_n$ that avoid a fixed permutation $\pi\in S_k$ in specific indices given by a $k$-uniform hypergraph $\Lambda$. We obtain relatively sharp bounds in the case where…
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
In order to compute Hermitian forms on representations of real reductive groups, in the unequal rank case, it is necessary to compute twisted Kazhdan-Lusztig-Vogan polynomials. These were defined by Lusztig and Vogan (Quasisplit Hecke…
We prove the combinatorial invariance of the coefficient of $q$ in Kazhdan--Lusztig polynomials for arbitrary Coxeter groups. As a result, we obtain the Combinatorial Invariance Conjecture, of Lusztig and of Dyer, also for Bruhat intervals…
Recently, Brualdi and Cao studied $I_k$-avoiding $(0,1)$-matrices by decomposing them into zigzag paths and proved that the maximum number of $1$'s in such a matrix is given by an exact formula. We further study the structure of maximal…