English
Related papers

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

200 papers

The current article is a short survey on the theory of Hecke algebras, and in particular Kazhdan-Lusztig theory, and on the theory of symplectic reflection algebras, and in particular rational Cherednik algebras. The emphasis is on the…

Representation Theory · Mathematics 2014-01-21 Maria Chlouveraki

This paper studies the Kazhdan-Lusztig coefficients $\mu(u,w)$ of the Kazhdan-Lusztig polynomials $P_{u,w}$ for the lowest cell ${c_{0}}$ of an affine Weyl group of type $\widetilde{G_{2}}$ and gives an estimation $\mu(u,w)\leqslant 3$ for…

Representation Theory · Mathematics 2014-03-26 Peng-Fei Guo , Hai-Tao Ma , Zhu-Jun Zheng

A much-studied problem posed by Motzkin asks to determine, given a finite set $D$ of integers, the so-called Motzkin density for $D$, i.e., the supremum of upper densities of sets of integers whose difference set avoids $D$. We study the…

Combinatorics · Mathematics 2025-10-22 Pablo Candela , Fernando Chamizo , Antonio Córdoba

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

In relation to Kostant's problem for simple highest weight modules over the general linear Lie algebra, we prove a persistence result for Kostant negative consecutive patterns. Inspired by it, we introduce the notion of a Kostant cuspidal…

Representation Theory · Mathematics 2026-01-16 Samuel Creedon , Volodymyr Mazorchuk

In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…

Discrete Mathematics · Computer Science 2024-06-17 Petr Gregor , Torsten Mütze , Namrata

Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

We present a combinatorial and computational commutative algebra methodology for studying singularities of Schubert varieties of flag manifolds. We define the combinatorial notion of *interval pattern avoidance*. For "reasonable" invariants…

Algebraic Geometry · Mathematics 2008-09-13 Alexander Woo , Alexander Yong

A Poisson geometry arising from maximal commutative subalgebras is studied. A spectral sequence convergent to Hochschild homology with coefficients in a bimodule is presented. It depends on the choice of a maximal commutative subalgebra…

K-Theory and Homology · Mathematics 2007-05-23 Tomasz Maszczyk

We consider the problem of jointly modeling and clustering populations of tensors by introducing a high-dimensional tensor mixture model with heterogeneous covariances. To effectively tackle the high dimensionality of tensor objects, we…

Methodology · Statistics 2024-11-21 Biao Cai , Jingfei Zhang , Will Wei Sun

We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…

Representation Theory · Mathematics 2022-11-21 Jonathan Gruber

There are representations of the type-A Hecke algebra on spaces of polynomials in anti-commuting variables. Luque and the author [S\'em. Lothar. Combin. 66 (2012), Art. B66b, 68 pages, arXiv:1106.0875] constructed nonsymmetric Macdonald…

Representation Theory · Mathematics 2021-05-25 Charles F. Dunkl

Kazhdan-Lusztig polynomials are important and mysterious objects in representation theory. Here we present a new formula for their computation for symmetric groups based on the Bruhat graph. Our approach suggests a solution to the…

Representation Theory · Mathematics 2023-09-06 Charles Blundell , Lars Buesing , Alex Davies , Petar Veličković , Geordie Williamson

Let $U_\zeta$ be a Lusztig quantum enveloping algebra associated to a complex semisimple Lie algebra $\mathfrak g$ and a root of unity $\zeta$. When $L,L'$ are irreducible $U_\zeta$-modules having regular highest weights, the dimension of…

Representation Theory · Mathematics 2018-07-16 Hankyung Ko

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class,…

Combinatorics · Mathematics 2015-09-07 David Bevan

Let $G$ be a Hermitian type Lie group with the complexified Lie algebra $\mathfrak{g}$. We use $L(\lambda)$ to denote a highest weight Harish-Chandra $G$-module with infinitesimal character $\lambda$. Let $w$ be an element in the Weyl group…

Representation Theory · Mathematics 2025-04-01 Zhanqiang Bai , Yixin Bao , Zhao Liang , Xun Xie

We study the homological algebra in the category $\mathcal{P}_p$ of strict polynomial functors of degree $p$ over a field of positive characteristic $p$. We determine the decomposition matrix of our category and we calculate the Ext-groups…

Representation Theory · Mathematics 2022-12-13 Patryk Jaśniewski

We show that the Kazhdan-Lusztig basis elements $C_w$ of the Hecke algebra of the symmetric group, when $w \in S_n$ corresponds to a Schubert subvariety of a Grassmann variety, can be written as a product of factors of the form…

Combinatorics · Mathematics 2012-08-27 Alexander Kirillov, , Alain Lascoux

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

Combinatorics · Mathematics 2013-06-21 Marie-Louise Bruner

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

Combinatorics · Mathematics 2021-05-24 Stoyan Dimitrov