Related papers: A Conjecture about Raising Operators for Macdonald…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

We present a new formula for umbral operators that yields three main insights. First, it makes explicit a connection between umbral calculus and iteration theory. Second, it leads naturally to a definition of fractional exponents of umbral…

We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik--Zamolodchikov equations, which arise by considering representations of the…

Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued…

Factorization of quantum mechanical Hamiltonians has been a useful technique for some time. This procedure has been given an elegant description by supersymmetric quantum mechanics, and the subject has become well-developed. We demonstrate…

Intermediate Macdonald polynomials for an affine root system $S$ with fixed origin and finite Weyl group $W_0$ are orthogonal polynomials invariant under a parabolic subgroup $W_J\le W_0$. The extreme cases of $W_J=1$ and $W_J=W_0$…

In this note unbounded hyperexpansive weighted composition operators are investigated. AS a consequence unbounded hyperexpansive multiplication and composition operators are characterized.

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…

To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Volume Conjecture for small angles states that the value of the $n$-th colored Jones polynomial at…

A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…

We introduce the concept of $\D$-operators associated to a sequence of polynomials $(p_n)_n$ and an algebra $\A$ of operators acting in the linear space of polynomials. In this paper, we show that this concept is a powerful tool to generate…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

We derive an algorithm to produce explicit formulas for certain generating functions of double Hurwitz numbers. These formulas generalize a formula of Goulden, Jackson and Vakil for one part double Hurwitz numbers. Immediate consequences…

In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals…

This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…