• Corpus ID: 8721290

Combinatorial polynomials as moments, Hankel transforms and exponential Riordan arrays

@article{Barry2011CombinatorialPA,
  title={Combinatorial polynomials as moments, Hankel transforms and exponential Riordan arrays},
  author={Paul Barry},
  journal={arXiv: Combinatorics},
  year={2011}
}
  • P. Barry
  • Published 16 May 2011
  • Mathematics
  • arXiv: Combinatorics
In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used for this. 

Hankel Determinants of the Generalized Factorials

Denote 〈x|d〉n = x(x + d)(x + 2d) · · · (x + (n - 1)d) for n = 1, 2, · · ·, and 〈x|d〉0 = 1, where 〈x|d〉n is called the generalized factorial of x with increment d. In this paper, we present the

The multidimensional maximum entropy moment problem: a review of numerical methods

Recently the author developed a numerical method for the multidimensional momentconstrained maximum entropy problem, which is practically capable of solving maximum entropy problems in the

References

SHOWING 1-10 OF 30 REFERENCES

Riordan arrays, orthogonal polynomials as moments, and Hankel transforms

Taking the examples of Legendre and Hermite orthogonal polynomials, we show how to interpret the fact that these orthogonal polynomials are moments of other orthogonal polynomials in terms of their

The Restricted Toda Chain, Exponential Riordan Arrays, and Hankel Transforms

We re-interpret results on the classification of Toda chain solutions given by Sheffer class orthogonal polynomials in terms of exponential Riordan arrays. We also examine associated Hankel

On a Family of Generalized Pascal Triangles Defined by Exponential Riordan Arrays

We introduce a family of number triangles defined by exponential Riordan arrays, which generalize Pascal’s triangle. We characterize the row sums and central coefficients of these triangles, and

Riordan arrays and combinatorial sums

Catalan Numbers, the Hankel Transform, and Fibonacci Numbers

We prove that the Hankel transformation of a sequence whose elements are the sums of two adjacent Catalan numbers is a subsequence of the Fibonacci numbers.

Some Observations on the Lah and Laguerre Transforms of Integer Sequences

We study the Lah and related Laguerre transforms within the context of exponential Riordan arrays. Links to the Stirling numbers are explored. Results for finite matrices are generalized, leading to

An Application of Sobolev Orthogonal Polynomials to the Computation of a Special Hankel Determinant

Many Hankel determinant computations arising in combinatorial analysis can be done using results from the theory of standard orthogonal polynomials. Here, we will emphasize special sequences which

Meixner-Type Results for Riordan Arrays and Associated Integer Sequences

We determine which (ordinary) Riordan arrays are the coefficient arrays of a family of orthogonal polynomials. In so doing, we are led to introduce a family of polynomials, which includes the

Bell polynomials

An introduction to Bell polynomials is given in order to see how they can be used to compute some of the classical counting functions of Combinatorics. They are also used to compute the Taylor

Generating Functions via Hankel and Stieltjes Matrices

TLDR
This work provides a constructive proof that the Stieltjes matrix SL associated with L is tridiagonal and demonstrates, constructively, a oneto-one correspondence between the generating function for the sequence and SL.