Related papers: A remark on Fourier pairing and binomial formula f…
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
We prove a fermionic-bosonic duality relation for the Macdonald index in Argyres-Douglas theories of type $(A_1, D_{2k+1})$, thereby yielding a conjectural fermionic formula due to Andrews et al. Our duality is built upon a new conjugate…
In this note we prove the optimality of a family of known coincidence theorems for absolutely summing multilinear operators. We connect our results with the theory of multiple summing multilinear operators and prove the sharpness of similar…
The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
We review properties of q-orthogonal polynomials, related to their orthogonality, duality and connection with the theory of symmetric (self-adjoint) operators, represented by a Jacobi matrix. In particular, we show how one can naturally…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
We present a slightly more general version of Boole's additive formula for factorials as a simple consequence of Lagrange's Interpolating Polynomial theorem.
In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a natural framework in which…
Recently, Yakubovich [Opuscula Math. 26 (2006) 161--172] and Passian et al. [J. Math. Anal. Appl. doi:10.1016/j.jmaa.2009.06.067] have presented alternative proofs of an orthogonality relation obeyed by the Macdonald functions of imaginary…
We consider two important families of BC_n-symmetric polynomials, namely Okounkov's interpolation polynomials and Koornwinder's orthogonal polynomials. We give a family of difference equations satisfied by the former, as well as…
We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…
We show how to use the method of orthogonal polynomials for integrating, in the planar approximation, the partition function of one-matrix models with a potential with even or odd vertices, or any combination of them.
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Interpolation polynomials were introduced by Knop--Sahi in type $A$, and Okounkov in type $BC$. They are inhomogeneous polynomials whose top terms are Jack and Macdonald polynomials. Thus the expansion coefficients for the product of two…