Related papers: The Bailey lemma and Kostka polynomials
We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…
In the large rank limit, for any nonexceptional affine algebra, the graded branching multiplicities known as one-dimensional sums, are conjectured to have a simple relationship with those of type A, which are known as generalized Kostka…
Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…
The two variable Kostka functions are the scalar products of the Macdonald polynomials with the Schur polynomials with respect to the scalar product which makes the Hall-Littlewood polynomials pairwise orthogonal. A conjecture of Macdonald…
Recently we have started a program to describe the action of Lie algebras associated with Dynkin-type diagrams on generic Verma modules in terms of polynomial vector fields. In this paper we explain that the results for the classical ABCD…
We revisit the Bohnenblust--Hille multilinear and polynomial inequalities and prove some new properties. Our main result is a multilinear version of a recent result on polynomials whose monomials have a uniformly bounded number of…
New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…
We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function.…
The aim of this paper is to give a corrected bijective proof of Vershik's relations for the Kostka numbers. Our proof uses insertion and reverse insertion algorithms, as in the combinatorial proof of the Pieri rule.
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…
A generalization of the q-(Pfaff)-Saalschutz summation formula is proved. This implies a generalization of the Burge transform, resulting in an additional dimension of the ``Burge tree''. Limiting cases of our summation formula imply the…
The notion of integral Bailey pairs is introduced. Using the single variable elliptic beta integral, we construct an infinite binary tree of identities for elliptic hypergeometric integrals. Two particular sequences of identities are…
A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previously known results. These formulas provide a well-defined algorithm for computing Selberg-Schur…
We announce a higher-dimensional generalization of the Bailey Transform, Bailey Lemma, and iterative ``Bailey chain'' concept in the setting of basic hypergeometric series very well-poised on unitary $A_{\ell}$ or symplectic $C_{\ell}$…
A Lemma of Riemann--Lebesgue type for Fourier--Jacobi coefficients is derived. Via integral representations of Dirichlet--Mehler type for Jacobi polynomials its proof directly reduces to the classical Riemann--Lebesgue Lemma for Fourier…
We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…
The first aim is to construct generalizations of Polya type point process by applying a branching mechanism to these point processes. Conditions are given under which these point processes satisfy an integration by parts formula.…
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and two-column Macdonald-Kostka polynomials occur as special cases. Conjecturally…
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…