Related papers: Macdonald polynomials as characters of Cherednik a…
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…
We use vertex operators to compute irreducible characters of the Iwahori-Hecke algebra of type $A$. Two general formulas are given for the irreducible characters in terms of those of the symmetric groups or the Iwahori-Hecke algebras in…
In this paper we compute the characters of certain non-irreducible N=4 superconformal modules which are different from the ones treated in our previous paper, and study their relation with characters of N=2 superconformal modules. Also, for…
Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…
We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide…
We prove Soergel's conjecture on the characters of indecomposable Soergel bimodules. We deduce that Kazhdan-Lusztig polynomials have positive coefficients for arbitrary Coxeter systems. Using results of Soergel one may deduce an algebraic…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…
We use recent results of Rolen, Zwegers, and the first author to study characters of irreducible (highest weight) modules for the vertex operator algebra $L_{\frak{sl}_\ell}(-\Lambda_0)$. We establish asymptotic behaviors of characters for…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…
We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. As a consequence we prove a conjecture of Bernevig and Haldane stated in the context of the fractional…
We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…
We obtain several results about representations of rational Cherednik algebras, and discuss their applications. Our first result is the Cohen-Macaulayness property (as modules over the polynomial ring) of Cherednik algebra modules with…
We derive combinatorial formulae for the modified Macdonald polynomial $H_{\lambda}(x;q,t)$ using coloured paths on a square lattice with quasi-cylindrical boundary conditions. The derivation is based on an integrable model associated to…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
We provide an algorithmic description of a family of graded decomposition numbers for rational Cherednik algebras.
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…
We determine the indecomposable characters of several classes of infinite dimensional groups associated with operator algebras, including the unitary groups of arbitrary unital simple AF algebras and II$_1$ factors.