相关论文: Evaluation of Sylvester type determinants using bl…

In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…

Elementary properties of the Koornwinder-Macdonald multivariable Askey-Wilson polynomials are discussed. Studied are the orthogonality, the difference equations, the recurrence relations, and the orthonormalization constants for these…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Preliminary version of Chapter 2 in the book "Encyclopedia of Special functions: The Askey-Bateman Project, Vol. 2: Multivariate special functions", T. H. Koornwinder and J. V. Stokman (eds.), Cambridge University Press, 2021.

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.

Within the framework of the theory of quaternion column-row determinants and using determinantal representations of the Moore-Penrose inverse previously obtained by the author, we get explicit determinantal representation formulas of…

We extend an algorithm suggested in 1858 by Sylvester and implemented in 1860 by Cayley for a problem of double partitions and apply it to derivation of explicit expressions for coefficients of the Gaussian polynomials through convolution…

This paper studies a family of convolution quadratures, a numerical technique for efficient evaluation of convolution integrals. We employ the block generalized Adams method to discretize the underlying initial value problem, departing from…

We develop a unified construction of matrix-valued orthogonal polynomials associated with discrete weights, yielding bispectral sequences as eigenfunctions of second-order difference operators. This general framework extends the discrete…

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

Using continued fraction expansions of certain polygamma functions as a main tool, we find orthogonal polynomials with respect to the odd-index Bernoulli polynomials $B_{2k+1}(x)$ and the Euler polynomials $E_{2k+\nu}(x)$, for $\nu=0, 1,…

A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…

The concept of orthogonality through the block factor (OTB), defined in Bagchi (2010), is extended here to orthogonality through a set (say S) of other factors. We discuss the impact of such an orthogonality on the precision of the…

The problem of evaluating potential integrals on planar triangular elements has been addressed using a polar coordinate decomposition. The resulting formulae are general, exact, easily implemented, and have only one special case, that of a…

Many limits are known for hypergeometric orthogonal polynomials that occur in the Askey scheme. We show how asymptotic representations can be derived by using the generating functions of the polynomials. For example, we discuss the…

We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option…

It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…

A certain determinant is evaluated by guessing and computing the LU-decomposition.

In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…