The Appell interpolation problem

A general linear interpolation problem is considered. We will call it the Appell interpolation problem because the solution can be expressed by a basis of Appell polynomials. Some classical and non-classical examples are also considered. Finally, numerical calculations are given.     

On Radon’s recipe for choosing correct sites for multivariate polynomial interpolation

A class of sets correct for multivariate polynomial interpolation is defined and verified, and shown to coincide with the collection of all correct sets constructible by the recursive application of Radon’s recipe, and a recent concrete recipe for correct sets is shown to produce elements in that class.     

Hermite-based Appell polynomials: Properties and applications

By employing certain operational methods, the authors introduce Hermite-based Appell polynomials. Some properties of Hermite-Appell polynomials are considered, which proved to be useful for the derivation of identities involving these polynomials. The possibility of extending this technique to introduce Hermite-based Sheffer polynomials (for example, Hermite-Laguerre and Hermite-Sister Celine's polynomials) is also investigated.     

Gauss级数与Appell级数

本文介绍了Ｇａｕｓ级数与Ａｐｐｅｌ级数的概念，并说明了这两类级数之间的渊源关系．     

C^1 C^2 INTERPOLATION OF SCATTERED DATA POINTS

In this paper an error in [4] is pointed out and a method for constructing surface interpolating scattered data points is presented, The main feature of the method in this paper is that the surface so constructed is polynomial, which makes the construction simple and the calculation easy.     

Appell systems on Lie groups

Using the probabilistic interpretation of Appell polynomials as systems of moments, we show how to define them in the noncommutative case. The method is based on certain infinite-dimensional representations of local Lie groups. For processes, limit theorems play an essential role in the construction. Polynomial matrix representations of convolution semigroups are a principal feature.     

Generalized Appell bases

In the context of Köthe spaces we study the bases related with the backward unilateral weighted shift operator, the so-called generalized derivation operator, extending known results for spaces of analytic functions. These bases are a subclass of Sheffer sequences called generalized Appell sequences and they are closely connected with the isomorphisms invariant by the weighted shift. We use methods of the non classical umbral calculi to give conditions for a generalized Appell sequence to be a basis.     

New characterization of Appell polynomials

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In addition, from our study, we obtain Fourier expansions of Appell polynomials. This result recovers Fourier expansions known for Bernoulli and Euler polynomials and obtains the Fourier expansions for higher order Bernoulli–Euler's one.     

Convergence of Sums of Appell Polynomials with Infinite Variance

We investigate the convergence of distributions of partial sums of Appell polynomials of a long-memory moving average process X _t with i.i.d. innovations _s in the case where the variance , and the distribution of #x03BE; ₀ ^m belongs to the domain of attraction of an -stable law with 1<< 2. We prove that the limit distribution of partial sums of Appell polynomials is either an -stable Lévy process, or an mth order Hermite process, or the sum of two mutually independent processes depending on the values of , m, and d, where 0X _t.     

Appell pseudopolynomials and Erlang-type risk models

Appell polynomials are known to play a key role in certain first-crossing problems. The present paper considers a rather general insurance risk model where the claim interarrival times are independent and exponentially distributed with different parameters, the successive claim amounts may be dependent and the premium income is an arbitrary deterministic function. It is shown that the non-ruin (or survival) probability over a finite horizon may be expressed in terms of a remarkable family of functions, named pseudopolynomials, that generalize the classical Appell polynomials. The presence of that underlying algebraic structure is exploited to provide a closed formula, almost explicit, for the non-ruin probability.     

Jacobi polynomials and generalized Clifford algebra‐valued Appell sequences

Appell sequences in Clifford analysis are defined as polynomial families on which the Heisenberg algebra acts through a raising and a lowering operator satisfying the canonical Heisenberg relation. Recently, these sequences have gained new interest, as they are connected to the topic of special functions (such as harmonic or monogenic Gegenbauer polynomials) and branching rules for certain irreducible representations of the spin group. In this paper, we will explain how Jacobi polynomials appear quite naturally in the setting of Appell sequences related to certain branching problems. Copyright © 2013 John Wiley & Sons, Ltd.     

On Appell sequences of polynomials of Bernoulli and Euler type

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number theoretical properties. A class of Euler-type polynomials is also presented.     

The relation of the d-orthogonal polynomials to the Appell polynomials

We are dealing with the concept of d-dimensional orthogonal (abbreviated d-orthogonal) polynomials, that is to say polynomials verifying one standard recurrence relation of order d + 1. Among the d-orthogonal polynomials one singles out the natural generalizations of certain classical orthogonal polynomials. In particular, we are concerned, in the present paper, with the solution of the following problem (P): Find all polynomial sequences which are at the same time Appell polynomials and d-orthogonal. The resulting polynomials are a natural extension of the Hermite polynomials.

A sequence of these polynomials is obtained. All the elements of its (d + 1)-order recurrence are explicitly determined. A generating function, a (d + 1)-order differential equation satisfied by each polynomial and a characterization of this sequence through a vectorial functional equation are also given. Among such polynomials one singles out the d-symmetrical ones (Definition 1.7) which are the d-orthogonal polynomials analogous to the Hermite classical ones. When d = 1 (ordinary orthogonality), we meet again the classical orthogonal polynomials of Hermite.     

Multivariate polynomial interpolation: Aitken–Neville sets and generalized principal lattices

A suitably weakened definition of generalized principal lattices is shown to be equivalent to the recent definition of Aitken–Neville sets.     

Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Recently, the first author introduced some cryptographic functions closely related to the Diffie-Hellman problem called P-Diffie-Hellman functions. We show that the existence of a low-degree polynomial representing a P-Diffie-Hellman function on a large set would lead to an efficient algorithm for solving the Diffie-Hellman problem. Motivated by this result we prove lower bounds on the degree of such interpolation polynomials. Analogously, we introduce a class of functions related to the discrete logarithm and show similar reduction and interpolation results.