Next Article in Journal
Multiple Optimal Solutions and the Best Lipschitz Constants Between an Aggregation Function and Associated Idempotized Aggregation Function
Next Article in Special Issue
Singular Integral Neumann Boundary Conditions for Semilinear Elliptic PDEs
Previous Article in Journal
A Relation-Theoretic Matkowski-Type Theorem in Symmetric Spaces
Previous Article in Special Issue
On Fractional q-Extensions of Some q-Orthogonal Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Pseudo-Lucas Functions of Fractional Degree and Applications

1
Section of Mathematics, International Telematic University UniNettuno, Corso Vittorio Emanuele II. 39, 00186 Rome, Italy
2
Department of Mathematics and Physics, Roma Tre University, Largo San Leonardo Murialdo, 1, 00146 Rome, Italy
*
Author to whom correspondence should be addressed.
Submission received: 24 February 2021 / Revised: 29 March 2021 / Accepted: 31 March 2021 / Published: 2 April 2021
(This article belongs to the Special Issue Special Functions Associated with Fractional Calculus)

Abstract

:
In a recent article, the first and second kinds of multivariate Chebyshev polynomials of fractional degree, and the relevant integral repesentations, have been studied. In this article, we introduce the first and second kinds of pseudo-Lucas functions of fractional degree, and we show possible applications of these new functions. For the first kind, we compute the fractional Newton sum rules of any orthogonal polynomial set starting from the entries of the Jacobi matrix. For the second kind, the representation formulas for the fractional powers of a r × r matrix, already introduced by using the pseudo-Chebyshev functions, are extended to the Lucas case.

1. Introduction

Applications of special functions and polynomials can be found in the solution to every problem in mathematical physics, engineering, statistics, biology, and in general, in applied mathematics. Among the numerous contributions, we want to mention here only a few articles in support of this pleonastic statement [1,2,3,4]. An important class of these functions is given by the hypergeometric functions, which unifies, through the introduction of suitable parameters, almost all special functions (see, e.g., [5,6,7,8,9,10]).
The most widely used in this area are the Chebyshev polynomials and the functions that constitute their extension to the case of the fractional index, which was recently introduced [11,12].
The classical Chebyshev polynomials have been generalized to the multivariate case [13,14,15,16,17]. A simple connection between the multivariate Lucas [18,19] and the Chebyshev polynomials has been shown in [20], and integral representations and generating functions [21] were derived.
Multivariate versions of such polynomials have also proved important. The case of pseudo-Chebyshev functions of fractional degree, generalizing the results in [11,12], have been considered in [22,23].
Multivariate Lucas polynomials of the second kind have proved useful for computing integer-exponent powers of a matrix [24]. In this regard it will not be useless to remember, once again, that every holomorphic function of a matrix, and in particular the exponential, is nothing but the polynomial interpolating the function on the matrix’s spectrum and then it is useless to consider expansions in series of the given matrix. However, this definition is also used today, despite it having been known of since the time of Sylvester [25]. Another useful observation in this area is the fact that when writing the powers of a matrix using the second kind of Lucas polynomials, only the invariants of the matrix are used—that is, the elements of the matrix and not the eigenvalues (and sometimes the eigenvectors, as in the case of the exponential). This results in a considerable economy of calculation.
Therefore, the advantage of considering Lucas polynomials consists of reducing the computational cost of such operations, and can be applied also in related problems, such as the solutions of linear dynamical systems [4] and the computation of sums of the powers of the zeros of a set of orthogonal polynomials [26].
Chebyshev multivariate functions of the second kind with a fractional index have recently been used for computing the roots of nonsingular complex matrices [22], and those of the first kind for computing the moments, with fractional exponent, of the density of zeros of a set of orthogonal polynomials [23].
It remains to define the multivariate Lucas polynomials of the first and second kind of fractional index (called for simplicity, pseudo-Lucas functions). This topic is considered in this paper to complement the results achieved previously.
In particular, since the computation of roots of a non-singular complex matrix by using the second kind of pseudo-Lucas functions is rather equivalent to that recently proposed exploiting the second kind of pseudo-Chebyshev functions [22,23,27], we limit ourselves to recall the the case of the square root a 3 × 3 matrix, but the obtained formulas can be extended to more general roots, with the due cautions indicated in [23], in relation to the multiplicities.
The first kind of pseudo-Lucas functions are applied, in what follows, to derive the fractional Newton sum rules for a general set of orthogonal polynomials, defined by a three-term recurrence relation (through its Jacobi matrix), extending the equations proven in [26,28,29,30].

2. Basic Definitions

We consider the r × r , matrix A = ( a i j ) , whose invariants are
u 1 : = t r A , u 2 : = i < j 1 , r a i i a i j a j i a j j , , u r : = d e t A .
Using, for shortness, u : = ( u 1 , u 2 , , u r ) , we denote by P ( λ ) = P ( u ; λ ) , its characteristic polynomial, so that the characteristic equation is:
P ( u ; λ ) : = d e t ( λ I A ) = λ r u 1 λ r 1 + u 2 λ r 2 + + ( 1 ) r u r = 0 .

2.1. Recalling the Multivariate Lucas Polynomials

The F k , n ( u ) functions are the basis of the r-dimensional vectorial space of solutions of the homogeneous linear bilateral recurrence relation with constant coefficients u k ( k = 1 , 2 , , r ) , (with u r 0 ):
X n = u 1 X n 1 u 2 X n 2 + + ( 1 ) r 1 u r X n r , ( n Z ) ,
whose characteristic equation coincides with (2).
All the properties of these functions and their applications can be found in [19,20].
The bilateral sequence { F 1 , n ( u ) } n Z was called, by É. Lucas [18], the fundamental solution of the recursion (3) (in French “fonction fondamentale”).
It satisfies the initial conditions:
F 1 , 1 = 0 , F 1 , 0 = 0 , , F 1 , r 3 = 0 , F 1 , r 2 = 1 .
In what follows, we write:
Φ n ( u ) : = F 1 , n ( u ) = F 1 , n ( u 1 , u 2 , , u r ) , ( n Z ) ,
for denoting the multivariate second kind of Lucas polynomials, (short form—MSK Lucas polynomials).
For the integer powers of the matrix A , in [20,24] the representation formula was shown:
A n = F 1 , n 1 ( u ) A r 1 + F 2 , n 1 ( u ) A r 2 + + F r , n 1 ( u ) I .
Since all the F k , n can be expressed in terms of the F 1 , n polynomials, the polynomials Φ n ( u ) , defined by putting
Φ n ( u ) : = F 1 , n ( u ) = F 1 , n ( u 1 , u 2 , , u r ) , ( n Z ) ,
appear as the natural tool for representing the integer powers of A , [20].
Another basic solution of the recursion (3) is the sum of integer powers of the roots of the characteristic Equation (2). This solution is denoted by { Ψ ( u ) } n Z , and is called the primordial solution (in French “fonction primordiale” by É. Lucas [18]):
Ψ n ( u ) : = Ψ n ( u 1 , u 2 , , u r ) , ( n Z ) .
We use for them the acronym MFK Lucas polynomials.
These polynomials are computed by using the initial conditions derived from the Newton formulas, [20]. More precisely, denoting by λ 1 , λ 2 , , λ r the roots of the characteristic Equation (2), we put:
Ψ r 1 = u 1 = h = 1 r λ h Ψ r = u 1 Ψ r 1 2 u 2 = u 1 2 2 u 2 = h = 1 r λ h 2 Ψ 2 r 2 = u 1 Ψ 2 r 3 u 2 Ψ 2 r 4 + + ( 1 ) r 2 u r 1 Ψ r 1 + ( 1 ) r 1 r u r = h = 1 r λ h r ,
For n > 2 r 2 we get:
Ψ n = u 1 Ψ n 1 u 2 Ψ n 2 + + ( 1 ) r 1 u r Ψ n r = h = 1 r λ h n r + 2
We have, in particular:
Ψ r 2 = r = h = 1 r λ h 0 .
The choice of the initial value of the indices is done in such a way that in the particular case r = 2 , and by having u 1 = 2 x and u 2 = 1 , the classical univariate Chebyshev polynomials, with the same indexes, are recovered.
When r > 2 , as it was remarked in [20], the MSK and MFK Lucas polynomials are related, in a very simple way, to the multivariate Chebyshev polynomials, introduced by R. Lidl and C. Wells [16], R. Lidl [15], and M. Bruschi and P.E. Ricci [21], and studied by K.B. Dunn and R. Lidl [14], and R.J. Beerends [13]).

Integral Representations

An integral form of the SKM and FKM Lucas polynomials has been proven in [22,23].
Theorem 1.
The SKM Lucas polynomials are represented by the integral formula:
Φ n ( u ) = 1 2 π i γ λ n + 1 P ( λ ) d λ .
Theorem 2.
The FKM Lucas polynomials are represented by the integral formula:
Ψ n ( u ) = 1 2 π i γ λ n r + 2 P ( λ ) P ( λ ) d λ .
The integral representations (11) and (12) have been used in [22,23] for defining the multivariate pseudo-Chebyshev functions of fractional order.

3. The Multivariate Pseudo-Lucas Functions

Using the integral representations (11) and (12), it is possible to define the second (first) kind of multivariate Lucas functions for rational values of their indexes, which will be denoted with the acronyms SKMP-L functions and FKMP-L functions. In fact we can say by definition:
Definition 1.
The SKMP-L functions are defined by the integral representation:
Φ p q ( u ) = 1 2 π i γ λ p q + 1 P ( λ ) d λ .
The FKMP-L functions are defined by the integral representation:
Ψ p q ( u ) = 1 2 π i γ λ p q r + 2 P ( λ ) P ( λ ) d λ .
Note that the computation of the integrals in Equations (11)–(14) can be obtained without knowing the roots λ 1 , λ 2 , , λ r , using the Gershgorin circle theorem and choosing as γ a circle, centered at the origin, surrounding all the eigenvalues.

3.1. Applications of the SKMP-L Functions

The SKMP-L functions can be applied in computing matrix roots, (and in particular, square roots), essentially with the same method used in [22,23], where the second kind of pseudo-Chebyshev (shortly SKMP-C) functions have been exploited. (See also [27], where the multiplicity problem of the roots was analyzed).
Here we show, for simplicity, only the case of the square root of a 3 × 3 non-singular complex matrix A , applying the SKMP-L functions to the particular case considered in Section 2.1.
Using definition (13), assuming p / q = 1 / 2 , Equation (6) becomes:
A 1 / 2 = Φ 1 / 2 ( u ) A 2 + u 2 Φ 3 / 2 ( u ) + u 3 Φ 5 / 2 ( u ) A + u 3 Φ 3 / 2 ( u ) I ,
where
Φ 1 / 2 ( u ) = 1 2 π i γ λ 1 / 2 P ( λ ) d λ , Φ 3 / 2 ( u ) = 1 2 π i γ λ 1 / 2 P ( λ ) d λ , 1 p t 26 p t Φ 5 / 2 ( u ) = 1 2 π i γ λ 3 / 2 P ( λ ) d λ .
The above equation can be obviously generalized to an r × r matrix and to a general fractional exponent, according to the results proven in [22,23] using the SKMP-C functions.

3.2. Applications of the FKMP-L Functions

In [22,23] the SKMP-L functions have been applied in computing matrix roots (in particular, square roots) (see also [27], where the multiplicity problem of the roots was analyzed).
In this Section we consider possible applications of the FKMP-L functions. As a matter of fact, in an old article (see [31] and the references therein), the FKM Lucas polynomials, according to Equation (12), have been used in order to represent the moments of the density of zeros of an orthogonal polynomial set, defined by a three term recurrence relation.
The definition of the nth moment of the density of zeros of a polynomial of degree r
μ n ( r ) : = 1 r k = 1 r λ k n ,
can be extended to the fractional degree by the following one, which could be useful in applied mathematics and statistics:
Definition 2.
The fractional moments of the density of zeros of the polynomial P ( λ ) , whose zeros are given by λ 1 , λ 2 , , λ r , can be defined as
μ p q ( r ) : = 1 r k = 1 r λ k p q ,
and are represented as
μ p q ( r ) = 1 r Ψ p q + r 2 ( u ) = 1 2 π i γ λ p q P ( λ ) r P ( λ ) d λ = 1 r λ 1 p q + λ 2 p q + + λ r p q .

4. A Recursion for the Coefficients of Orthogonal Polynomial Sets

We consider a polynomial set defined through a three-term recurrence relation:
P 1 = 0 , P 0 = 1 , P n ( x ) = ( x α n ) P n 1 ( x ) β n 1 2 P n 2 ( x ) , ( n 1 ) ,
with real parameters α n and β n , and β n 1 0 . According to a theorem by Favard (see e.g., [32]), the corresponding polynomials belong to a set orthogonal with respect to a suitable measure.
The parameters are usually arranged in the tridiagonal symmetric Jacobi matrix J n :
J n = α 1 β 1 0 0 0 0 β 1 α 2 β 2 0 0 0 0 0 0 0 α n 1 β n 1 0 0 0 0 β n 1 α n ,
characterizing the considered set of orthogonal polynomials. In several articles the Newton sum rules of such polynomials have been determined, without computing the relevant zeros, in different frameworks. This was done starting from the Jacobi matrix in [31]; from the ordinary differential equation in [28]; from the three term recurrence relation in [30]. Additionally, the case of associated and co-recursive polynomials has been considered in [29].
In what follows, in order to limit our approach, we will only consider the case of polynomials generated by the recurrence (18).
In analogy to the preceding formulas, we put: u ( n ) : = ( u ( 1 , n ) , u ( 2 , n ) , u ( n , n ) ) , and
P n ( x ) = k = 0 n ( 1 ) k u ( k , n ) x n k , ( n = 1 , 2 , ) ,
and denote by
x 1 , n , x 2 , n , , x n , n ,
the zeros of P n ( x ) , and by
y h ( n ) = k = 1 n x k , n h , ( h = 1 , 2 , ) ,
the Newton sum rules corresponding to the zeros (21).
In [30] the following results were proven:
Theorem 3.
For the coefficients u ( k , n ) appearing in Equation (20), the following recursion holds:
u ( k , n ) = u ( k , n 1 ) + α n u ( k 1 , n 1 ) β n 1 2 u ( k 2 , n 2 ) ,
( k = 1 , 2 , , n ; n = 1 , 2 , ), where, by definition,
u ( n , n 1 ) = u ( 1 , n 1 ) = u ( 1 , n 2 ) = u ( 2 , n 2 ) = 0 .
According to the Newton–Girard formulas, the starting values of the recursion in Equation (23) are given by:
u ( 1 , n ) = y 1 ( n ) , u ( 2 , n ) = u ( 1 , n ) y 1 ( n ) y 2 ( n ) / 2 = y 1 2 ( n ) y 2 ( n ) / 2 , u ( 3 , n ) = u ( 1 , n ) y 2 ( n ) + u ( 2 , n ) y 1 ( n ) + y 3 ( n ) / 3 = y 1 2 ( n ) y 2 ( n ) / 6 , u ( n , n ) = ( 1 ) n u ( 1 , n ) y n 1 ( n ) + ( 1 ) n 1 u ( 2 , n ) y n 2 ( n ) + + u ( n 1 , n ) y 1 ( n ) + ( 1 ) n 1 y n ( n ) / n .
Theorem 4.
The coefficients of P n ( x ) are recursively linked to the entries of the Jacobi matrix (19) by Equation (23), and the relevant Newton sum rules are represented as
y h ( n ) = k = 1 n x k , n h = Ψ h + n 2 u ( n ) , ( h = 1 , 2 , ) .

5. The Case of Fractional Moments

Comparing Equations (9)–(12) with (14), the following result immediately follows:
Theorem 5.
For any fixed rational numbers p / q , q 0 , and for any polynomial degree n, the rational moments of the density of zeros of the polynomial P n ( x ) defined in (20) can be computed as
μ p q ( n ) : = 1 n k = 1 n x k , n p q = y p q ( n ) n = 1 n Ψ p q + n 2 ( u ( n ) ) = 1 2 n π i γ ξ p q P n ( ξ ) P n ( ξ ) d ξ .
Using Equation (26), the computation of rational moments is performed without knowing the zeros of P n ( x ) , since it is sufficient to assume as γ a circle, centered at the origin, surrounding all the zeros of P n ( x ) . The value of the first member follows from the computation of the contour integral.
Remark 1.
Recalling Cauchy’s bounds for the roots of polynomials [33,34], it immediately follows that the radius of the circle γ could be chosen as
2 + max | u ( n 1 , n ) | | u ( n , n ) | , | u ( n 2 , n ) | | u ( n , n ) | , , 1 | u ( n , n ) | .
Remark 2.
Note that the fractional powers have several determinations, depending on the denominator q, but in the examined case, dealing with orthogonal polynomials, all the zeros are real, so in the preceding equations the roots are supposed to be the arithmetical values, and in the contour integral the powers of ξ are intended to be the principal values.

6. Numerical Computations

In this section a few checks of the preceding Equation (26) have been performed by the second author, considering particular Jacobi polynomials as the second kind of Chebyshev polynomial U 4 ( z ) , the Legendre polynomial P 5 ( z ) , the third kind of Chebyshev polynomial V 4 ( z ) , and the fourth kind of Chebyshev polynomial W 5 ( z ) (see [35]).
The numerical computations confirm the results of Section 6, unless an error is smaller than the machine error.

6.1. Second Kind of Chebyshev Polynomial U 4 ( z )

We have: U 4 ( z ) = 16 z 4 12 z 2 + 1 . By choosing p / q = 2 / 3 , and denoting by ξ k , ( k = 1 , 2 , 3 , 4 ) the zeros of U 4 ( z ) , we find:
μ 2 3 ( 4 ) = 1 8 π i γ ξ 2 3 ( 64 ξ 3 24 ξ ) 16 ξ 4 12 ξ 2 + 1 d ξ = 1 4 k = 1 4 Res ξ 2 3 4 ξ 3 2 3 ξ ξ 4 3 4 ξ + 1 16 , ξ k 1 p t 26 p t = 0.662656547986741 = 1 4 k = 1 4 ξ k 2 3 .

6.2. Legendre Polynomial P 5 ( z )

We have: P 5 ( z ) = 1 8 63 z 5 70 z 3 + 15 z . By choosing p / q = 2 / 5 , and denoting by ξ k , ( k = 1 , 2 , 3 , 4 , 5 ) the zeros of P 5 ( z ) , we find:
μ 2 5 ( 5 ) = 1 10 π i γ ξ 2 5 5 ξ 4 10 3 ξ 2 + 5 21 ξ ξ 5 10 9 ξ 3 + 5 21 ξ d ξ = 1 5 k = 1 5 Res ξ 2 5 5 ξ 4 10 3 ξ 2 + 5 21 ξ ξ 5 10 9 ξ 3 + 5 21 ξ , ξ k 1 p t 26 p t = 0.696809509722981 = 1 5 k = 1 5 ξ k 2 5 .

6.3. Third Kind of Chebyshev Polynomial V 4 ( z )

We have: V 4 ( z ) = P 4 ( 1 / 2 , 1 / 2 ) ( z ) = 35 128 16 4 + 8 z 3 12 z 2 4 z + 1 . By choosing p / q = 2 / 3 , and denoting by ξ k , ( k = 1 , 2 , 3 , 4 ) the zeros of V 4 ( z ) , we find:
μ 2 3 ( 4 ) = 1 8 π i γ ξ 2 3 ( 4 ξ 3 + 3 2 ξ 2 3 2 ξ 1 4 ) ξ 4 + 1 2 ξ 3 3 4 ξ 2 1 4 ξ + 1 16 d ξ 1 p t 30 p t = 1 4 k = 1 4 Res ξ 2 3 4 ξ 3 + 3 2 ξ 2 3 2 ξ 1 4 ξ 4 + 1 2 ξ 3 3 4 ξ 2 1 4 ξ + 1 16 , ξ k = 0.6844515633130234 = 1 4 k = 1 4 ξ k 2 3 .

6.4. Fourth Kind Chebyshev Polynomial W 5 ( z )

We have: W 5 ( z ) = P 5 ( 1 / 2 , 1 / 2 ) ( z ) = 63 256 32 z 5 16 z 4 32 z 3 + 12 z 2 + 6 z 1 . By choosing p / q = 6 / 5 , and denoting by ξ k , ( k = 1 , 2 , 3 , 4 , 5 ) the zeros of W 5 ( z ) , we find:
μ 6 5 ( 5 ) = 1 10 π i γ ξ 6 5 ( 5 ξ 4 2 ξ 3 3 ξ 2 + 3 4 ξ + 3 16 ) ξ 5 1 2 ξ 4 ξ 3 + 3 8 ξ 2 + 3 16 ξ 1 32 d ξ 1 p t 30 p t = 1 5 k = 1 5 Res ξ 6 5 5 ξ 4 2 ξ 3 3 ξ 2 + 3 4 ξ + 3 16 ξ 5 1 2 ξ 4 ξ 3 + 3 8 ξ 2 + 3 16 ξ 1 32 , ξ k = 0.5621593212493105 1 p t 26 p t = 1 5 k = 1 5 ξ k 6 5 .

7. Conclusions

By using the integral representation formulas for the multivariate second (first) kind of Lucas polynomials, it was possible to define the second (first) kind of pseudo-Lucas functions of fractional order. An application of the second kind of pseudo-Lucas functions have been touched on in the problem of computing matrix roots, according to the same technique exploited by using the second kind of pseudo-Chebyshev functions. Furthermore, recalling preceding papers on the sum rules for zeros of polynomials, we have used the first kind of pseudo-Lucas functions of fractional degree in order to compute the fractional moments of the density of zeros for an orthogonal polynomial set, starting from its Jacobi matrix and avoiding the knowledge of zeros.

Author Contributions

The authors C.C., P.N. and P.E.R. have contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Caratelli, D. Incomplete Anger-Weber Functions: A Class of Special Functions for Electromagnetics. Radio Sci. 2019, 54, 331–348. [Google Scholar] [CrossRef] [Green Version]
  2. Dattoli, G.; Cesarano, C. On a new family of Hermite polynomials associated to parabolic cylinder functions. Appl. Math. Comput. 2003, 141, 143–149. [Google Scholar] [CrossRef]
  3. Dattoli, G.; Lorenzutta, S.; Cesarano, C. Bernestein polynomials and operational methods. J. Comput. Anal. Appl. 2006, 8, 369–377. [Google Scholar]
  4. Natalini, P.; Ricci, P.E. Solution of linear dynamical systems using Lucas polynomials of the second kind. Appl. Math. 2016, 7, 616–628. [Google Scholar] [CrossRef] [Green Version]
  5. Srivastava, H.M.; Kizilateş, C. A parametric kind of the Fubini-type polynomials. Rev. Real Acad. Cienc. Exactas Fís. Natur. Ser. A Mat. (RACSAM) 2019, 113, 3253–3267. [Google Scholar] [CrossRef]
  6. Srivastava, H.M.; Ricci, P.E.; Natalini, P.P. A family of complex Appell polynomial sets. Rev. Real Acad. Cienc. Exactas Fís. Natur. Ser. A Mat. (RACSAM) 2019, 113, 2359–2371. [Google Scholar] [CrossRef]
  7. Srivastava, H.M.; Riyasat, M.; Khan, S.; Araci, S.; Acikgoz, M. A new approach to Legendre-truncated-exponential-based Sheffer sequences via Riordan arrays. Appl. Math. Comput. 2020, 369, 124683. [Google Scholar] [CrossRef]
  8. Srivastava, R.; Cho, N.E. Generating functions for a certain class of incomplete hypergeometric polynomials. Appl. Math. Comput. 2012, 219, 3219–3225. [Google Scholar] [CrossRef]
  9. Srivastava, R. Some properties of a family of incomplete hypergeometric functions. Russ. J. Math. Phys. 2013, 20, 121–128. [Google Scholar] [CrossRef]
  10. Srivastava, R. Some classes of generating functions associated with a certain family of extended and generalized hypergeometric functions. Appl. Math. Comput. 2014, 243, 132–137. [Google Scholar] [CrossRef]
  11. Ricci, P.E. Complex spirals and pseudo-Chebyshev polynomials of fractional degree. Symmetry 2018, 10, 671. [Google Scholar] [CrossRef] [Green Version]
  12. Ricci, P.E. A survey on pseudo-Chebyshev functions. 4Open 2020, 3, 2. [Google Scholar] [CrossRef]
  13. Beerends, R.J. Chebyshev polynomials in several variables and the radial part of the Laplace-Beltrami operator. Trans. Am. Math. Soc. 1991, 328, 779–814. [Google Scholar] [CrossRef]
  14. Dunn, K.B.; Lidl, R. Multi-dimensional generalizations of the Chebyshev polynomials. I and II. Proc. Jpn. Acad. Ser. A Math. Sci. 1980, 56, 154–165. [Google Scholar] [CrossRef]
  15. Lidl, R. Tschebyscheffpolynome in mehreren variabelen. J. Reine Angew. Math. 1975, 273, 178–198. [Google Scholar]
  16. Lidl, R.; Wells, C. Chebyshev polynomials in several variables. J. Reine Angew. Math. 1972, 255, 104–111. [Google Scholar]
  17. Ricci, P.E. I polinomi di Tchebycheff in più variabili. Rend. Mat. Ser. 6 1978, 11, 295–327. [Google Scholar]
  18. Lucas, É. Théorie des Nombres; Gauthier-Villars: Paris, France, 1891. [Google Scholar]
  19. Raghavacharyulu, I.V.V.; Tekumalla, A.R. Solution of the Difference Equations of Generalized Lucas Polynomials. J. Math. Phys. 1972, 13, 321–324. [Google Scholar] [CrossRef]
  20. Bruschi, M.; Ricci, P.E. I polinomi di Lucas e di Tchebycheff in più variabili. Rend. Mat. Ser. 6 1980, 13, 507–530. [Google Scholar]
  21. Bruschi, M.; Ricci, P.E. An explicit formula for f(A) and the generating function of the generalized Lucas polynomials. SIAM J. Math. Anal. 1982, 13, 162–165. [Google Scholar] [CrossRef]
  22. Ricci, P.E.; Srivastava, R. A Study of the Second-Kind Multivariate Pseudo-Chebyshev Functions of Fractional Degree. Mathematics 2020, 8, 978. [Google Scholar] [CrossRef]
  23. Ricci, P.E.; Srivastava, R. A note on multivariate pseudo-Chebyshev functions of fractional degree. Appl. Anal. Optim. 2020. to appear. [Google Scholar]
  24. Ricci, P.E. Sulle potenze di una matrice. Rend. Mat. Ser. 6 1976, 9, 179–194. [Google Scholar]
  25. Natalini, P.; Ricci, P.E. A “hard to die” series expansion and Lucas polynomials of the second kind. Appl. Math. 2015, 6, 1235–1240. [Google Scholar] [CrossRef] [Green Version]
  26. Ricci, P.E. Sum rules for zeros of polynomials and generalized Lucas polynomials. J. Math. Phys. 1993, 34, 4884–4891. [Google Scholar] [CrossRef]
  27. Ricci, P.E. On the roots of complex r × r matrices. Lect. Notes TICMI 2020. to appear. [Google Scholar]
  28. Natalini, P.; Ricci, P.E. Computation of Newton sum rules for polynomial solutions of O.D.E. with polynomial coefficients. Riv. Mat. Univ. Parma 2000, 3, 69–76. [Google Scholar]
  29. Natalini, P.; Ricci, P.E. Computation of the Newton sum rules for associated and co-recursive classical orthogonal polynomials. J. Comput. Appl. Math. 2001, 133, 495–505. [Google Scholar] [CrossRef] [Green Version]
  30. Natalini, P.; Ricci, P.E. Newton sum rules of polynomials defined by a three-term recurrence relation. Computers Math. Applic. 2001, 42, 767–771. [Google Scholar] [CrossRef] [Green Version]
  31. Germano, B.; Ricci, P.E. Representation formulas for the moments of the density of zeros of orthogonal polynomial sets. Le Matematiche 1993, 48, 77–86. [Google Scholar]
  32. Chihara, T.S. An Introduction to Orthogonal Polynomials; Gordon & Breach: New York, NY, USA, 1978. [Google Scholar]
  33. Hirst, H.P.; Macey, W.T. Bounding the Roots of Polynomials. Coll. Math. J. 1997, 28, 292–295. [Google Scholar] [CrossRef]
  34. Parodi, M. La Localisation des Valeurs Caractéristiques des Matrices et Ses Applications; Gauther-Villars: Paris, France, 1959. [Google Scholar]
  35. Aghigh, K.; Masjed-Jamei, M.; Dehghan, M. A survey on third and fourth kind of Chebyshev polynomials and their applications. Appl. Math. Comput. 2008, 199, 2–12. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Cesarano, C.; Natalini, P.; Ricci, P.E. Pseudo-Lucas Functions of Fractional Degree and Applications. Axioms 2021, 10, 51. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10020051

AMA Style

Cesarano C, Natalini P, Ricci PE. Pseudo-Lucas Functions of Fractional Degree and Applications. Axioms. 2021; 10(2):51. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10020051

Chicago/Turabian Style

Cesarano, Clemente, Pierpaolo Natalini, and Paolo Emilio Ricci. 2021. "Pseudo-Lucas Functions of Fractional Degree and Applications" Axioms 10, no. 2: 51. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10020051

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop