A matrix recurrence for systems of Clifford algebra-valued orthogonal polynomials

Recently, the authors developed a matrix approach to multivariate polynomial sequences by using methods of Hypercomplex Function Theory ("Matrix representations of a basic polynomial sequence in arbitrary dimension". Comput. Methods Funct. Theory, 12 (2012), no. 2, 371-391). This paper deals with an extension of that approach to a recurrence relation for the construction of a complete system of orthogonal Clifford-algebra valued polynomials of arbitrary degree. At the same time the matrix approach sheds new light on results about systems of Clifford algebra-valued orthogonal polynomials obtained by Guerlebeck, Bock, Lavicka, Delanghe et al. during the last five years. In fact, it allows to prove directly some intrinsic properties of the building blocks essential in the construction process, but not studied so far.Fundação para a Ciência e a Tecnologia (FCT

Three-term recurrence relations for systems of Clifford algebra-valued orthogonal polynomials

Recently, systems of Clifford algebra-valued orthogonal polynomials have been studied from different points of view. We prove in this paper that for their building blocks there exist some three-term recurrence relations, similar to that for orthogonal polynomials of one real variable. As a surprising byproduct of own interest we found out that the whole construction process of Clifford algebra-valued orthogonal polynomials via Gelfand-Tsetlin basis or otherwise relies only on one and the same basic Appell sequence of polynomials.This work was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications of the University of Aveiro, the CMAT - Research Centre of Mathematics of the University of Minho and the FCT - Portuguese Foundation for Science and Technology (“Fundação para a Ciˆencia e a Tecnologia”), within projects PEst-OE/MAT/UI4106/2014 and PEst-OE/MAT/UI0013/2014.info:eu-repo/semantics/publishedVersio

On an hypercomplex generalization of Gould-Hopper and related Chebyshev polynomials

An operational approach introduced by Gould and Hopper to the construction of generalized Hermite polynomials is followed in the hypercomplex context to build multidimensional generalized Hermite polynomials by the consideration of an appropriate basic set of monogenic polynomials. Directly related functions, like Chebyshev polynomials of first and second kind are constructed

On numerical aspects of pseudo-complex powers in R^3

In this paper we consider a particularly important case of 3D monogenic polynomials that are isomorphic to the integer powers of one complex variable (called pseudo-complex powers or pseudo-complex polynomials, PCP). The construction of bases for spaces of monogenic polynomials in the framework of Clifford Analysis has been discussed by several authors and from different points of view. Here our main concern are numerical aspects of the implementation of PCP as bases of monogenic polynomials of homogeneous degree k. The representation of the well known Fueter polynomial basis by a particular PCP-basis is subject to a detailed analysis for showing the numerical effciency of the use of PCP. In this context a modiffcation of the Eisinberg-Fedele algorithm for inverting a Vandermonde matrix is presented.This work was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, the Research Centre of Mathematics of the University of Minho and the Portuguese Foundation for Science and Technology ("FCT - Fundacao para a Ciencia e a Tecnologia"), within projects PEst-OE/MAT/UI4106/2014 and PEstOE/MAT/UI0013/2014

Hypercomplex polynomials, vietoris’ rational numbers and a related integer numbers sequence

This paper aims to give new insights into homogeneous hypercomplex Appell polynomials through the study of some interesting arithmetical properties of their coefficients. Here Appell polynomials are introduced as constituting a hypercomplex generalized geometric series whose fundamental role sometimes seems to have been neglected. Surprisingly, in the simplest non-commutative case their rational coefficient sequence reduces to a coefficient sequence S used in a celebrated theorem on positive trigonometric sums by Vietoris (Sitzungsber Österr Akad Wiss 167:125–135, 1958). For S a generating function is obtained which allows to derive an interesting relation to a result deduced by Askey and Steinig (Trans AMS 187(1):295–307, 1974) about some trigonometric series. The further study of S is concerned with a sequence of integers leading to its irreducible representation and its relation to central binomial coefficients.The work of the first and third authors was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, and the Portuguese Foundation for Science and Technology (“FCT-Fundação para a Ciência e Tecnologia”), within project PEstOE/MAT/UI4106/2013. The work of the second author was supported by Portuguese funds through the CMAT - Centre of Mathematics and FCT within the Project UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio

Matrix representations of a special polynomial sequence in arbitrary dimension

This paper provides an insight into different structures of a special polynomial sequence of binomial type in higher dimensions with values in a Clifford algebra. The elements of the special polynomial sequence are homogeneous hypercomplex differentiable (monogenic) functions of different degrees and their matrix representation allows to prove their recursive construction in analogy to the complex power functions. This property can somehow be considered as a compensation for the loss of multiplicativity caused by the non-commutativity of the underlying algebra.Fundação para a Ciência e a Tecnologia (FCT

A unified matrix approach to the representation of Appell polynomials

In this paper, we propose a unified approach to matrix representations of different types of Appell polynomials. This approach is based on the creation matrix – a special matrix which has only the natural numbers as entries and is closely related to the well-known Pascal matrix. By this means, we stress the arithmetical origins of Appell polynomials. The approach also allows to derive, in a simplified way, the properties of Appell polynomials by using only matrix operations

Shifted Generalized Pascal Matrices in the Context of Cli ord Algebra-Valued Polynomial Sequences

The paper shows the role of shifted generalized Pascal matrices in a matrix representation of hypercomplex orthogonal Appell systems. It extends results obtained in previous works in the context of Appell sequences whose rst term is a real constant to sequences whose initial term is a suitable chosen polynomial of n variables