相关论文: Binomial formula for Macdonald polynomials

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

In this elementary paper we prove that the extra vanishing property characterizes the BC interpolation Macdonald polynomials inside a very general class of multivariate interpolation polynomials. It follows that they are the only…

We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…

In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

In this paper we present a formula for Macdonald's polynomials for the root system A(n-1) which arises from the representation theory of quantum sl(n). This formula expresses Macdonald's polynomials via (weighted) traces of intertwining…

In this paper we present a Mathematica notebook for computing nonsymmetric and interpolation Macdonald polynomials. We present the new recursive generation algorithm employed within the notebook and the theory required for its development.…

In this paper, we gave some properties of binomial coefficient.

We introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials…

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

This paper presents a closed form polynomial expression for the binary cyclotomic polynomial. We contrast this against expressions for binary cyclotomic polynomials in (Lam and Leung 1996) and (Lenstra 1979).

In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

The Macdonald polynomials can be obtained by acting on the constant 1 with creation operators. Three different expressions for these operators are derived, one from the other, in a rather succint way. When the last of these expressions is…

We give operational formulae of Burchnall type involving complex Hermite polynomials. Short proofs of some known formulae are given and new results involving these polynomials, including Nielsen's identities and Runge addition formula, are…

We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we show that the Pieri formula for Macdonald polynomials and its recently discovered inverse, a recursion formula for Macdonald polynomials,…

We prove a version of van der Corput's Lemma for polynomials over the p-adic numbers.