Open AccessArticle Operational Methods in the Study of Sobolev-Jacobi Polynomials by Nicolas BehrNicolas Behr SciProfiles Scilit Preprints.org Google Scholar 1,*, Giuseppe DattoliGiuseppe Dattoli SciProfiles Scilit Preprints.org Google Scholar 2, Gérard H. E. DuchampGérard H. E. Duchamp SciProfiles Scilit Preprints.org Google Scholar 3, Silvia LicciardiSilvia Licciardi SciProfiles Scilit Preprints.org Google Scholar 2 and Karol A. PensonKarol A. Penson SciProfiles Scilit Preprints.org Google Scholar 4 1 Institut de Recherche en Informatique Fondamentale (IRIF), Université Paris-Diderot, F-75013 Paris, France 2 ENEA—Frascati Research Center, Via Enrico Fermi 45, 00044 Rome, Italy 3 Laboratoire d’Informatique de Paris-Nord (LIPN), CNRS UMR 7030, Université Paris 13, Sorbonne Paris Cité, F-93430 Villetaneuse, France 4 Laboratoire de Physique Theorique de la Matière Condensée (LPTMC), CNRS UMR 7600, Sorbonne Universités, Université Pierre et Marie Curie, F-75005 Paris, France * Author to whom correspondence should be addressed. Mathematics 2019, 7(2), 124; https://doi.org/10.3390/math7020124 Submission received: 3 November 2018 / Revised: 19 January 2019 / Accepted: 22 January 2019 / Published: 24 January 2019 Download keyboard_arrow_down Download PDF Download PDF with Cover Download XML Download Epub Versions Notes Abstract: Inspired by ideas from umbral calculus and based on the two types of integrals occurring in the defining equations for the gamma and the reciprocal gamma functions, respectively, we develop a multi-variate version of umbral calculus and of the so-called umbral image technique. Besides providing a class of new formulae for generalized hypergeometric functions and an implementation of series manipulations for computing lacunary generating functions, our main application of these techniques is the study of Sobolev-Jacobi polynomials. Motivated by applications to theoretical chemistry, we moreover present a deep link between generalized normal-ordering techniques introduced by Gurappa and Panigrahi, two-variable Hermite polynomials and our integral-based series transforms. Notably, we thus calculate all K-tuple L-shifted lacunary exponential generating functions for a certain family of Sobolev-Jacobi (SJ) polynomials explicitly. Keywords: Sobolev-Jacobi polynomials; umbral image techniques; generalized normal-ordering; lacunary generating functions MSC: 33C45; 05A40 (Primary) 30B10; 05A15 (Secondary) 1. IntroductionThe operational methods established in the second half of the 19th century have paved the way to the formalism of quantum mechanics and of umbral calculus [1]. The formulation and the technicalities of the quasi-monomiality [2] deepened their roots in the operational formalism and offer a powerful tool to simplify most of the computations associated with the handling of special functions relevant e.g., to the evaluation of generating functions, integrals, and other associated issues. The methods which we will exploit in this paper trace back to the original formulation [1,3], merged with the complementary aspects developed within the context of the solution of evolution problems [4] and the theory of generalized special functions [5]. Some of the aforementioned complementary aspects were already developed in a wide range of fields, including astrophysics [6], quantum mechanics [7], free-electron lasers [8] and heat conduction [9], with some of the most recent developments reported in [10,11,12,13,14] (which are based on [2,3,4,5,15]).Among the well-established results of such operational methods are formulae such as the operational definition of the two-variable Hermite polynomials H n ( m ) ( x , y ) : H n ( m ) ( x , y ) : = e y d m d x m x n = n ! ∑ k = 0 ⌊ n m ⌋ x n − k m y k ( n − k m ) ! k ! (1) In this paper, based on a remarkable operational technique developed by Gurappa and Panigrahi [16,17,18,19], we will present an extension of the concept of such exponential formulae by virtue of including a rational function of the Euler operator D = x d d x in the exponential. This will provide a definition of the Sobolev-Jacobi (SJ) polynomials, which are the central objects of our study here.The second main technical tool for our study is the so-called umbral image method, which has been introduced in [20,21,22] (see also [15,23]). In favorable cases, this method simplifies computations associated with special functions or orthogonal polynomials considerably. Some concrete examples of such techniques are presented in Section 2. However, in the applications related to SJ polynomials studied in this paper, we will need a certain multi-variate extension of the umbral image method, which we realize in the form of integral transforms related to gamma function-type integrals. This allows us to clarify en passant several technical details that remain somewhat implicit in the traditional umbral calculus approach. Our technique is entirely elementary and, while motivated by and largely analogous to the ideas of umbral calculus, is mathematically self-contained.Referring the interested readers to [24] for a more detailed exposition and further technical details, we would like to briefly mention our original motivation in studying SJ polynomials, which stems from the theory of chemical reaction systems. It is customary in this field to encode the dynamics of such systems in terms of certain probability generating functions and evolution equations thereof, thus in certain special cases, (generalized) orthogonal polynomials may take the role of eigenfunctions of the evolution operators and may thus permit to solve the dynamics problem in closed form. The simplest possible example in which SJ polynomials arise is the case of a chemical reaction system of one species of molecules and with a single reaction of the form 2 X ⇀ ∅ (whence in each transition two particles of type X decay, for simplicity at unit base rate). Mathematically, we may describe the system via defining a probability generating function (with real-valued time parameter t and formal variable x) P ( t ; x ) : = ∑ n ≥ 0 p n ( t ) x n (2) where x n encodes the system state of having n particles present, and p n ( t ; x ) the probability of encountering such a state at time t. The evolution equation of this reaction system reads ∂ ∂ P ( t ; x ) = ( 1 − x ^ 2 ) ∂ 2 ∂ x 2 P ( t ; x ) ( t ≥ 0 ) (3) with x ^ the formal multiplication operator on formal power series (i.e., x ^ ( x n ) = x n + 1 ). As will be presented in full technical detail in Section 3, the Sobolev-Jacobi polynomials of a particular type are precisely the eigenfunctions of the differential operator ( 1 − x ^ 2 ) ∂ 2 ∂ x 2 . Given an initial system state, which could for example consist in a state with precisely N 0 particles (whence P ( 0 ; x ) = x N 0 ), one may provide a closed-form solution to (3) if it is in addition possible to express the initial configuration in terms of the SJ polynomials, a computation which requires knowledge of the so-called connection coefficients and which is performed in Section 5.6. We mention in passing that the Sobolev-Jacobi polynomials for the other set of parameters as discussed in Section 4 are another particularly interesting case of relevance to chemical reaction systems, since as explained in [24] they permit to solve exactly problems involving reaction systems with all three elementary decay-type reactions of one particle species present.Structure of the paper: In Section 2, we introduce an integral transform technique that permits to implement the analogue of multi-variate umbral images in the spirit of umbral calculus. Sobolev-Jacobi polynomials are introduced in Section 3, and some first results for a particular subclass of such polynomials are presented in Section 4. The remaining class of Sobolev-Jacobi (SJ) polynomials is studied in detail starting from Section 5, including a type of generalized normal-ordering technique involving Euler operators in Section 5.1 that is of relevance to these considerations. We then proceed to compute both exponential and lacunary exponential generating functions for the SJ polynomials in Section 5.2 and Section 5.5. This study is made possible due to a discovery of a deep relationship between two-variable Hermite polynomials and SJ polynomials, which is explained in Section 5.3, and which relies on our series transform techniques (which coincidentally also permit a concise definition of lacunary exponential generating functions (EGF) themselves, see Section 5.4). Finally, we devote Section 5.6 to the study of the connection coefficients of the SJ polynomials, and provide some further details and proofs in the technical appendices. 2. Multi-Variate Umbral Calculus via Integral TransformsThe key result of this section will be a reformulation (and suitable extension of) the so-called umbral image method [15,20,21,22,25], which permits to perform certain widely applicable types of series transforms. Rather than working with the umbral calculus notions of operators acting on “umbral vacua” as typical in the more traditional formulations of umbral calculus (see e.g., [23] for an extensive overview of modern umbral calculus), we opt here for an alternative approach: series transforms will be implemented based on certain elementary integrals. Our motivations are two-fold: firstly, we wish to make our techniques accessible to a wider audience, and thus found it necessary to develop a formulation that is both mathematically sound and firmly rooted in well-established elementary concepts. Secondly, the calculations in this paper will often require the analogues of multi-variate umbral calculus techniques, which are immediately accessible in our present formalism, but in tendency would require certain somewhat ad hoc constructions in the traditional approach. For the interested readers’ convenience, we will present several illustrative examples, in which we will also comment on the relationship to the more traditional umbral calculus approach.The two types of integrals upon which our calculus will be based are those of the defining equations for the gamma function (Equation (5.2.1) in [26]), Γ ( z ) : = ∫ 0 ∞ d t e − t t z − 1 (4) and of the reciprocal gamma function (Equation (5.9.2) in [26]) 1 Γ ( z ) = 1 2 π i ∫ γ d t e t t − z (5) here, according to loc. cit., t − z is understood as having its principal value where t crosses the positive real axis and is continuous, and the integration is taken along the Hankel contour γ (see [26], Image 5.9.F1). It is well-known that Γ ( z ) as defined in (4) (and for R e ( z ) < 0 by analytic continuation) is a meromorphic function with no zeros, and simple poles at z = − n ( n ∈ Z ≤ 0 ) of residue ( − 1 ) n / n ! . The reciprocal gamma function 1 / Γ ( z ) is an entire function with simple zeros at z = − n ( n ∈ Z ≤ 0 ). The gamma function (resp. reciprocal gamma function) used here will be its full analytic continuation to C \ Z ≤ 0 (resp. C ).As a second key ingredient, we will need the following notion of generalized monomials (and of formal power series thereover):Definition 1. Let A be an alphabet (i.e., a set of symbols or of formal variables), and let C ( A ) denote the set of all functions α : A → C with finite support, C ( A ) : = { α : A → C ∣ | s u p p ( α ) | < ∞ } (6) Here, we define the support s u p p ( α ) of a function α : A → C as the set of elements a ∈ A on which α takes non-zero values, i.e., s u p p ( α ) : = { a ∈ A ∣ α ( a ) ≠ 0 } .Then we denote by G C ( X ) ≡ ( C ( A ) , · ) the group of generalized monomials, whose multiplication · is defined as A α · A β = A α + β (7) here, we have employed the multi-index notation { A α } α ∈ C ( A ) (8) such that for a given function α : A → C with support s u p p ( α ) = { a 1 , … , a n } ⊂ A the corresponding element A α ∈ G C ( A ) reads more explicitly A α = a 1 α ( a 1 ) … a n α ( a n ) (9) Moreover, we denote by C [ G C ( A ) ] the C -algebra of the group G C ( A ) .It is instructive to note that for an element A α ∈ G C ( A ) with s u p p ( α ) ⊂ Z , A α is nothing but a Laurent polynomial, while for s u p p ( α ) ⊂ Z ≥ 0 it is an ordinary polynomial, which motivated the moniker “generalized monomials” for generic elements of G C ( A ) . In other words, a generic element A α ∈ G C ( A ) might be thought of as a “monomial with complex exponents”.Combining the notion of generalized polynomials (extended to certain formal power series) with the two types of integrals as introduced above, we will now introduce a formal integration operator that will play the central role in our implementation of multi-variate umbral calculus.Definition 2. Let A = { λ } ⊎ U ⊎ V ⊎ X be an alphabet of formal variables, where ⊎ denotes the operation of disjoint union, and where { λ } , U , V and X are four (disjoint) alphabets of auxiliary formal variables. We will typically employ notations such as X = { x , y , x 1 , x 2 , … } , where we make use of the indexed variable notations in case of many variables for convenience. Let furthermore A • = A \ { λ } .We define a formal integration operator I ^ via specifying first its domain d o m ( I ^ ) as d o m ( I ^ ) : = { S ∈ C [ G C ( A • ) ] [ [ λ ] ] ∣ f o r a l l A α ∈ s u p p ( S ) : r a a n g e ( α | U ) ⊂ C \ Z ≤ 0 } (10) whence elements of d o m ( I ^ ) are formal power series in λ with coefficients that are generalized polynomials over the alphabet A • (where the extension to formal power series requires a suitable notion of summability, see below). Here, the notation r a n g e ( α | U ) ⊂ C \ Z ≤ 0 entails that functions α : A • → C are required to not take zero or negative integer values when evaluated on elements of U . Then for some monomial A α ∈ d o m ( I ^ ) , which reads more explicitly (recall that by definition of C ( A ) , we have that α ( u i ) ≠ 0 and α ( v j ) ≠ 0 for only finitely many indices i and j) A α = u 1 α ( u 1 ) u 2 α ( u 2 ) … v 1 α ( v 1 ) v 2 α ( v 2 ) … the action of I ^ on A α is defined as I ^ A α : = ∏ u i ∈ U ( α ) ∫ 0 ∞ d u i e − u i u i ∏ v j ∈ V ( α ) 1 2 π i ∫ γ d v j e v j A α ˜ U ( α ) : = s u p p ( α ) ∩ U , V ( α ) : = s u p p ( α ) ∩ V α ˜ ( a ) : = α ( a ) i f a ∈ A \ V − α ( a ) i f a ∈ V (11) We extend I ^ by linearity to finite sums. For infinite sums, this requires an appropriate notion of convergence. A series ∑ i ∈ I c i A α i will be in d o m ( I ^ ) (the domain of I ^ ) if the family c i I ^ ( A α i ) i ∈ I is summable in the target (in the sense of discrete summability or compact convergence for entire functions). For example, in Equation (19), the target is the space of entire functions endowed with the topology of compact convergence. In the sequel, the target will always be a topological ring to ensure continuity of products and sums.Note that our definition of the integration over the formal variables V (i.e., integrating the monomial A α ¯ given an input A α ) was designed purely for notational convenience, i.e., such as to avoid having to carry negative exponents in our standard application of e.g., expressing 1 / Γ ( β ) as I ^ ( v β ) (see also the examples provided in Section 2 for further illustrations).The readers may verify that our choice of domain d o m ( I ^ ) as given in (10) precisely ensures that we avoid the poles in the definition of Γ ( z ) in our series transformation calculations, which renders the technique mathematically well-posed. In all of our practical applications, we will further restrict the formal power series in d o m ( I ^ ) to r a n g e ( α ) ∩ X ⊂ Z ≥ 0 , which entails that the group of monomials G C ( A • ) restricts to a group for V , a semigroup for X and not even a semigroup for U : for example, consider the admissible monomial u − 1 2 , whose square is not in the domain.The operator I ^ is multiplicative on monomials whose underlying alphabets do not overlap, and it is checked easily that it is not so, in general, for monomials and sums of monomials which have variables in common. To ensure mathematical consistency, we provide the reader below with a precise statement on multiplicativity.Lemma 1. We suppose thatthe alphabet A is partitioned into two disjoint subalphabets A = A 1 ⊎ A 2 we are given two series S 1 = ∑ i ∈ I 1 c α i A 1 α i and S 2 = ∑ j ∈ I 2 c α j A 2 α j such that S 1 , S 2 ∈ d o m ( I ^ ) .Then I ^ ( S 1 S 2 ) exists and I ^ ( S 1 S 2 ) = I ^ ( S 1 ) I ^ ( S 2 ) Proof. In the sequence of steps below, I ^ ( S 1 ) I ^ ( S 2 ) = ( 1 ) ∑ i ∈ I 1 c α i I ^ ( A 1 α i ) ∑ j ∈ I 2 c α j I ^ ( A 2 α j ) = ( 2 ) ∑ ( i , j ) ∈ I 1 × I 2 c α i c α j I ^ ( A 1 α i ) I ^ ( A 2 α j ) = ( 3 ) ∑ ( i , j ) ∈ I 1 × I 2 c α i c α j I ^ ( A 1 α i A 2 α j ) = ( 4 ) I ^ ∑ ( i , j ) ∈ I 1 × I 2 c α i c α j A 1 α i A 2 α j = ( 5 ) I ^ ( S 1 S 2 ) step ( 1 ) follows because S k , k = 1 , 2 are in d o m ( I ^ ) , step ( 2 ) because the target is a topological ring, step ( 3 ) because the alphabets are disjoint, step ( 4 ) because the series is summable, and finally step ( 5 ) via rewriting of the argument (which is summable for the discrete topology). □ Examples and Relation to Traditional Umbral CalculusConsider first as an elementary example the formulae (for α ∈ C \ Z ≤ 0 and β ∈ C ) I ^ u α = Γ ( α ) , I ^ v β = 1 Γ ( β ) (12) Compared to the umbral calculus literature, we find the analogous equations (see e.g., [20,21,22]) d ^ γ ψ 0 : = Γ ( γ + 1 ) , c ^ δ φ 0 : = 1 Γ ( δ + 1 ) (13) here, ψ 0 and φ 0 are the “umbral vacua”, and we have the parameters γ ∈ C \ Z ≤ − 1 and δ ∈ C . The “umbrae” c ^ and d ^ are usually further characterized by formulae such as c ^ α c ^ β φ 0 = c ^ α + β φ 0 , d ^ γ d ^ δ ψ 0 = d ^ γ + δ ψ 0 (14) However, it is important to note that α , β and α + β must all be elements of C \ Z ≤ − 1 , which renders claims that c ^ satisfies some group-like properties as typical in the umbral calculus parlance somewhat questionable. Moreover, typically the precise typing of the “vacua” is left implicit, thereby adding to the difficulties in validating umbral techniques beyond individual application examples. The nature of the “vacua” becomes even more implicit to characterize upon considering multi-variate extensions of the umbral methods, the analogues of which in our own formulation will find frequent application in this paper. Here, we thus prefer to work instead solely based on the definition of the operation I ^ , taking care in each individual example that I ^ is applied to a well-formed expression in its domain D ( λ ; U , V ; X ) .To provide a few first application examples for our integral operator approach seen to manipulate formal power series, note first that by definition (for α , β ∈ C \ Z ≤ 0 and n ∈ Z ≥ 0 ) I ^ u α + n v α = Γ ( α + n ) Γ ( α ) = ( α ) n , I ^ u β v β + n = Γ ( β ) Γ ( β + n ) = 1 ( β ) n (15) here, we employ the notation ( x ) y : = Γ ( x + y ) / Γ ( x ) for the Pochhammer symbol, as customary e.g., in the literature on hypergeometric functions. The relations provided in (15) induce an interesting alternative formula for the generalized hypergeometric functions, with parameters α i , β j ∈ C \ Z ≤ 0 , and where we consider the variable z as formal in order to avoid issues of convergence (see e.g., [26], §16.2, according to which in particular all generalized hypergeometric series with p > q + 1 are divergent): p F q α ̲ β ̲ ; z ≡ p F q ( α i ) 1 ≤ i ≤ p ( β j ) 1 ≤ j ≤ q ; z : = ∑ n ≥ 0 z n n ! ( α 1 ) n ⋯ ( α p ) n ( β 1 ) n ⋯ ( β q ) n (16) namely p F q α ̲ β ̲ ; z = I ^ ∏ i = 1 p ( u i v i ) α i ∏ j = 1 q ( u j + p v j + p ) β j e z u 1 ⋯ u p v p + 1 ⋯ v p + q (17) To demonstrate the utility of the integral transform approach as a method to study special functions, we next present an adaptation of a result obtained with umbral methods in [21]. Consider first the following computation: I ^ ( G v ( x ) ) : = I ^ v e − v x 2 2 (18a) = I ^ ∑ r ≥ 0 ( − 1 ) r r ! x 2 2 r v r + 1 (18b) = ∑ r ≥ 0 ( − 1 ) r ( r ! ) 2 x 2 2 r = J 0 ( x ) . (18c) here, J 0 ( x ) denotes the 0-th order cylindrical Bessel function. We have thus established that the so-called umbral image of the Gaussian function G α ( x ) : = α exp ( − α ( x / 2 ) 2 ) (at α = v and integrated using the operation I ^ ) is the function J 0 ( x ) . This finding may be further generalized to the following relation involving the n-th order cylindrical Bessel functions J n ( x ) : I ^ v v x 2 n e − v x 2 2 = ∑ r = 0 ∞ ( − 1 ) r ( n + r ) ! r ! x 2 n + 2 r = J n ( x ) (19) As explained in [21], such a restyling has allowed noticeable simplifications, concerning the handling of integrals of Bessel functions and of many other problems associated with the use of the Ramanujan master theorem. For the purposes of the present paper, a multi-variate analogue of the “umbral image” concept will permit us to uncover some hidden structures in the study of SJ polynomials.Our methods inherit several equivalences from the properties of the gamma and reciprocal gamma functions, which depending on the application may pose an obstacle or a virtue but are in a certain sense unavoidable. Based on the functional relations Γ ( z + 1 ) = z Γ ( z ) ( z ∈ C \ Z ≤ 0 ) we find the umbral image analogues (for α , β ∈ C \ Z ≤ 0 ) I ^ e ∂ ∂ a u a | a → α = I ^ u α + 1 = I ^ α u α = I ^ ∂ ∂ u u α I ^ e ∂ ∂ b v b | b → β = I ^ v β + 1 = I ^ v β β (20) For convenience, we will from hereon take a notational convention for formal derivatives that permits to rewrite the first line of the above equation in the more concise form e ∂ β v β ≡ e ∂ ∂ b v b | b → β (21) As an example, for interesting consequences of such identities, consider Euler’s beta function ([26], §5.12) B ( α , β ) B ( α , β ) = Γ ( α ) Γ ( β ) Γ ( α + β ) = I ^ u 1 α u 2 β v α + β (22) here and throughout the remainder of this section, we assume that α and β are in the domain of definition of B ( α , β ) , whence that α , β ∈ C \ Z ≤ 0 with ( α + β ) ∈ C \ Z ≤ 0 . Owing to its well-known property (obtained by multiplying numerator and denominator by ( α + β ) ) B ( α , β ) = ( α + β ) Γ ( α ) Γ ( β ) ( α + β ) Γ ( α + β ) = α Γ ( α ) Γ ( β ) Γ ( α + β + 1 ) + β Γ ( α ) Γ ( β ) Γ ( α + β + 1 ) = B ( α + 1 , β ) + B ( α , β + 1 ) , (23) we may identify B ( α , β ) as eigenfunctions of eigenvalue 1 of the differential operator e ∂ α + e ∂ β , B ( α , β ) = e ∂ α + e ∂ β B ( α , β ) (24a) ⇔ I ^ u 1 α u 2 β v α + β = I ^ e ∂ α + e ∂ β u 1 α u 2 β v α + β = I ^ u 1 α u 2 β v α + β + 1 ( u 1 + u 2 ) (24b) We find in fact an infinite tower of equivalences by noting that for any non-negative integer n ∈ Z ≥ 0 , B ( α , β ) = e ∂ α + e ∂ β n B ( α , β ) (25a) ⇔ I ^ u 1 α u 2 β v α + β = I ^ e ∂ α + e ∂ β n u 1 α u 2 β v α + β = I ^ u 1 α u 2 β v α + β + n ( u 1 + u 2 ) n (25b) Moreover, by rephrasing (23) in the form B ( α , β + 1 ) = B ( α , β ) − B ( α + 1 , β ) = 1 − e ∂ α B ( α , β ) (26) iterating yields the family of identities (for n ∈ Z ≥ 0 ) B ( α , β + n ) = 1 − e ∂ α n B ( α , β ) (27a) ⇔ I ^ u 1 α u 2 β + n v α + β + n = I ^ 1 − e ∂ α n u 1 α u 2 β v α + β = I ^ u 1 α u 2 β v α + β 1 − u 1 v n (27b) The last Equation (27b) will prove to be of particular importance for the forthcoming discussion. It will be exploited to settle out the proof of important identities, whose technicalities are detailed e.g., in Appendix D.We conclude this section with a particularly interesting use of the auxiliary relations (20), regarding explicit expressions for the derivative of generalized hypergeometric functions p F q ( α ̲ , β ̲ ; z ) (which we will need in our calculations of shifts of lacunary generating functions in Section 5.5). Acting with a derivative by z on (17) and using the auxiliary relations (20) repeatedly leads to: ∂ ∂ z p F q α ̲ β ̲ ; z = I ^ ∏ i = 1 p ( u i v i ) α i ∏ j = 1 q ( u j + p v j + p ) β j u 1 ⋯ u p v p + 1 ⋯ v p + q e z u 1 ⋯ u p v p + 1 ⋯ v p + q = ∏ i = 1 p α i ∏ j = 1 q β j I ^ ∏ i = 1 p ( u i v i ) α i + 1 ∏ j = 1 q ( u j + p v j + p ) β j + 1 e z u 1 ⋯ u p v p + 1 ⋯ v p + q (28) We thus find the expression ∂ ∂ z p F q α ̲ β ̲ ; z = ∏ i = 1 p α i ∏ j = 1 q β j p F q α + 1 ̲ β + 1 ̲ ; z . (29) Proceeding analogously for higher z-derivatives then reproduces the following closed-form expression (see Chapter 1.30.1.1 in [27]), for n ∈ Z > 0 : ∂ n ∂ z n p F q α ̲ β ̲ ; z = ∏ i = 1 p ( α i ) n ∏ j = 1 q ( β j ) n p F q α + n ̲ β + n ̲ ; z (30) 3. The Sobolev-Jacobi PolynomialsWe introduce (following Kwon and Littlejohn [28,29,30]) the SJ polynomials P ˜ n ( − 1 , − β ) ( x ) as the polynomial eigenfunctions of the Jacobi-type differential operators D ^ J a c ( − 1 , β ) (with β ∈ R ≥ − 1 ): D ^ J a c ( − 1 , β ) P ˜ n ( − 1 , β ) ( x ) = − n ( n + β ) P ˜ n ( − 1 , β ) ( x ) D ^ J a c ( − 1 , β ) = ( 1 − x ^ 2 ) ∂ x 2 + ( β + 1 ) 1 − x ^ ∂ x (31) here, we have made use of the notations x ^ and ∂ x for the following linear operators: x ^ f ( x ) : = x f ( x ) , ∂ x f ( x ) = ∂ ∂ x f ( x ) (32) It will prove useful in our later considerations that x ^ and ∂ x form a representation of the Heisenberg-Weyl algebra (i.e., the Bargmann-Fock representation): [ ∂ x , x ^ ] = 𝟙 (33) For clarity, let us briefly comment on the relationship of the SJ polynomials to the ordinary Jacobi polynomials P n ( α , β ) ( x ) . The Jacobi-type differential operator(cf. the standard reference book [31], chapter 18, p. 445, Table 18.8.1) D ^ J a c ( α , β ) : = ( 1 − x 2 ) ∂ x 2 + q ( α , β ) ( x ) ∂ x q ( α , β ) ( x ) = ( β − α − ( α + β + 2 ) x ) (34) with real parameters α , β > − 1 (35) is known to possess a system of orthogonal polynomials { P n ( α , β ) ( z ) } n ≥ 0 , the so-called classical Jacobi polynomials, as its complete basis of eigenfunctions (see (38) for the associated inner product). More explicitly (cf. e.g., Equation (18.5.8) in [31]), P n ( α , β ) ( x ) = ∑ ℓ = 0 n n + α ℓ n + β n − ℓ x − 1 2 n − ℓ x + 1 2 ℓ (36) satisfying the eigenequation D ^ J a c ( α , β ) P n ( α , β ) ( x ) = − n ( n + α + β + 1 ) P n ( α , β ) ( x ) (37) The orthogonality property is found by defining for each admissible choice of parameters α , β > − 1 an inner product Φ α , β on the space of polynomials R [ x ] , Φ α , β ( p , q ) : = ∫ − 1 + 1 d x w α , β ( x ) p ( x ) q ( x ) (38a) w α , β ( x ) : = ( 1 − x ) α ( 1 + x ) β , p , q ∈ R [ x ] (38b) It is one of the classical results of the theory of orthogonal polynomials that for all n ≥ 0 P n ( α , β ) ( x ) ∈ L α , β 2 ( [ − 1 , 1 ] ) (39) here, L α , β 2 ( [ − 1 , 1 ] ) denotes the space of functions on the interval [ − 1 , 1 ] which are square-integrable with respect to the integral against the weight function w α , β ( z ) . Moreover, orthogonality manifests itself as Φ α , β P m ( α , β ) , P n ( α , β ) = δ m , n ϕ α , β ( n ) (40) where ϕ α , β ( n ) ∈ R > 0 are some (non-zero) real numbers.However, if one wishes to study a Jacobi-type differential operator with α = − 1 and either β > − 1 or β = − 1 , the family of polynomials { P n ( α , β ) ( x ) } n ∈ Z ≥ 0 ceases to constitute a complete system of orthogonal polynomials: for both cases, the polynomial P 0 ( − 1 , β ) ( x ) = 1 is not integrable, and moreover in the case α = − 1 and β = − 1 one finds that P 1 ( − 1 , − 1 ) ( x ) = 0 . Referring to [24] for a detailed discussion, the resolution of this problem proposed by Kwon and Littlejohn [28,29,30,32] consists in redefining the notion of orthogonality: one no longer requires orthogonality of the polynomials with respect to the inner product Φ α , β , but instead defines a Sobolev-type inner product. We quote from [30] the relevant material (cf. Propositions 4.2 and 4.3 of loc cit):Proposition 1. Let the Sobolev inner products Φ A , B ( − 1 , − 1 ) and Φ C ( − 1 , β ) (for β > − 1 ) be defined as follows (for p , q ∈ R [ x ] some polynomials with real coefficients): Φ A , B ( − 1 , − 1 ) ( p , q ) : = A p ( 1 ) q ( 1 ) + B p ( − 1 ) q ( − 1 ) + ∫ − 1 + 1 d x p ′ ( x ) q ′ ( x ) Φ C ( − 1 , β ) ( p , q ) : = C p ( 1 ) q ( 1 ) + ∫ − 1 + 1 d x ( x + 1 ) β + 1 p ′ ( x ) q ′ ( x ) ( β > − 1 ) (41) here, p ′ ( x ) and q ′ ( x ) denote the first derivatives of the polynomials, and A , B , C ∈ R are parameters. For the resulting inner products to be positive definite, the parameters A , B , C ∈ R must satisfy the following conditions: for Φ A , B ( − 1 , − 1 ) , A, and B must verify A + B > 0 , A ( γ + 1 ) 2 + B ( γ − 1 ) 2 + 2 ≠ 0 , A ( γ + 1 ) + B ( γ − 1 ) = 0 , γ : = ( B − A ) / ( A + B ) (42) while for Φ C ( − 1 , β ) the parameter C must verify C > 0 (43) Then the SJ orthogonal polynomials P ˜ n ( α , β ) ( x ) are defined for α = − 1 , β = − 1 as P ˜ 0 ( − 1 , − 1 ) ( x ) : = 1 P ˜ 1 ( − 1 , − 1 ) ( x ) : = x + γ P ˜ n ≥ 2 ( − 1 , − 1 ) ( x ) : = 2 n − 2 n − 1 ∑ k = 1 n − 1 n − 1 k n − 1 n − k ( x − 1 ) n − k ( x + 1 ) k (44) where γ = ( B − A ) / ( A + B ) , while for the parameters α = − 1 , β > − 1 one defines P ˜ 0 ( − 1 , β ) ( x ) : = 1 P ˜ 1 ( − 1 , β ) ( x ) : = x − 1 P ˜ n ≥ 2 ( − 1 , β ) ( x ) : = 2 n + β − 1 n − 1 ∑ k = 0 n n − 1 k n + β n − k ( x − 1 ) n − k ( x + 1 ) k (45) The polynomials P ˜ n ( α , β ) ( x ) form a complete orthogonal system of polynomial eigenfunctions of the Jacobi differential operator at parameters in the aforementioned parameter ranges.The readers may have noticed that indeed the SJ polynomials P ˜ n ( α , β ) ( x ) as defined above coincide for n ≥ 2 with the monic versions of the classical Jacobi polynomials (i.e., a different normalization choice where in each polynomial of degree n the coefficient of x n is normalized to be 1).There exists an alternative approach to the definition of the SJ polynomials due to Gurappa and Panigrahi [16,17,18,33,34,35], which will prove quintessential to our present paper. Quite remarkably, their technique of solving rather general differential equations by providing a constructive algorithm to determine polynomial eigenfunctions of the respective differential operators leads to a unified construction of classical and SJ monic orthogonal polynomials (albeit the authors do not appear to highlight this feature explicitly in their articles). Since there unfortunately appears to occur a systematic typographic error in loc. cit. in the equations pertaining to Jacobi polynomials, we will now present a careful re-derivation of the relevant results.Specializing the general technique of Gurappa and Panigrahi to the Jacobi-type differential Equations (31)and (34), consider an eigenequation of the form (37), where we however from here on permit the parameter ranges α , β ∈ R ≥ − 1 (i.e., explicitly including the special cases α = − 1 and β = − 1 or β > − 1 discussed above). We will temporarily employ the notation P ˜ n ( α , β ) ( x ) for this extended parameter range (with P ˜ n ( α , β ) ( x ) : = P n ( α , β ) ( x ) if α > − 1 and β > − 1 ). The first step in their technique consists in a certain splitting of the linear operators in the eigenequation (37) into a “diagonal” part F n ( α , β ) ( D ^ x ) and an “non-diagonal” part N ( x ^ , ∂ x ) (where we chose to use the notation N ( … ) for the “non-diagonal” parts rather than the notation P ( … ) used in loc cit. in order to avoid any potential confusion of the operator N ( … ) with polynomials): 0 = D ^ J a c ( α , β ) + n ( n + α + β + 1 ) P ˜ n ( α , β ) ( x ) = ( F n ( α , β ) ( D ^ x ) + N ( x ^ , ∂ x ) ) P ˜ n ( − 1 , β ) ( x ) (46) Here, D ^ x : = x ^ ∂ x denotes the Euler operator, whence the diagonal operator with action on monomials D ^ x x n = n x n (47) Using the canonical commutation relation (33) to compute the auxiliary formula D ^ x 2 = x ^ 2 ∂ x 2 + D ^ x (48) the concrete expressions for the operators F n ( α , β ) ( D ^ x ) and N ( x ^ , ∂ x ) in (46) read (see Appendix A for the details of the derivation; compare [35], which however contains a slight error in the respective formula for F n ( α , β ) ( D ^ x ) ): F n ( α , β ) ( D ^ x ) : = − ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) N ( x ^ , ∂ x ) = ∂ x 2 + ( β − α ) ∂ x (49) The key idea of the technique of Gurappa and Panigrahi consists then in recognizing the following relationship: F n ( α , β ) ( D ^ x ) x n = 0 (50) Moreover, F n ( α , β ) ( D ^ x ) acts as a diagonal operator on any monomial, which allows to perform the following computations (with shorthand notations F ^ n ≡ F n ( α , β ) ( D ^ x ) , considered temporarily as a symbol, and N ^ ≡ N ( x ^ , ∂ x ) ): 0 = ( F ^ n + N ^ ) P ˜ n ( − 1 , β ) ( x ) = F ^ n ( 1 + 1 F ^ n N ^ ) P ˜ n ( − 1 , β ) ( x ) (51) where it is important to note that 1 F ^ n and N ^ do not commute, whence the ordering in the last equation is important. The final step of the technique then consists in recognizing the following expression for the eigenfunctions: P ˜ n ( α , β ) ( x ) = c n 1 1 + 1 F ^ n N ^ x n = c n ∑ m ≥ 0 ( − 1 ) m 1 F ^ n N ^ m x n (52a) = c n ∑ m ≥ 0 1 ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) ∂ x 2 + ( β − α ) ∂ x m x n . (52b) here, the non-zero real parameter c n ∈ R \ { 0 } is a normalization constant. The proof that the functions P ˜ n ( α , β ) ( x ) as defined in (52) indeed solve the eigenequation is straightforward (cf. e.g., [18]): ( F ^ n + N ^ ) P ˜ n ( α , β ) ( x ) = F ^ n ( 1 + 1 F ^ n N ^ ) c n 1 1 + 1 F ^ n N ^ x n = c n F ^ n ( 1 + 1 F ^ n N ^ ) ∑ m ≥ 0 ( − 1 ) m 1 F ^ n N ^ m x n = c n F ^ n x n = ( 50 ) 0 Since in applications we will be interested in studying the monic SJ polynomials (i.e., with leading coefficient equal to 1), we will set c n = 1 for all n ∈ Z ≥ 0 , and summarize the findings of this section with the following proposition:Proposition 2. The (monic) SJ polynomials P ˜ n ( − 1 , β ) ( x ) (with β ∈ R ≥ − 1 and n ∈ Z ≥ 0 ) and the classical monic Jacobi polynomials P ˜ n ( α , β ) ( x ) (for α , β ∈ R > − 1 ), defined as P ˜ n ( α , β ) ( x ) = ∑ m ≥ 0 1 ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) ∂ x 2 + ( β − α ) ∂ x m x n (53) are polynomial eigenfunctions of the Jacobi-type differential operator D ^ n ( α , β ) with eigenvalues λ n ( α , β ) = − n ( n + α + β + 1 ) (54) The degeneracies of the denominator in (53) are counteracted by the derivatives, so the statement can be made rigorous by completing this operator with identity on its kernel: for α + β + 1 ≠ 0 we have that k e r ( ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) ) = C x n and for α + β + 1 = 0 k e r ( ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) ) = C x n ⊎ C 1 Completing the operator by the identity map on its kernel renders ( D ^ x − n ) ( D ^ x + n + α + β + 1 ) invertible. The readers may verify easily that I d can be replaced by any invertible endomorphism N → N without modifying the final result of Equation (53).The detailed analysis of the two cases (i) α = β = − 1 , and (ii) α = − 1 and β > − 1 will reveal that the corresponding families of SJ polynomials have in fact a rather distinct structure. Accordingly, they will be treated separately in the following. 4. SJ Polynomials for α = − 1 and β > − 1 Compared to the SJ polynomials with parameters α = β = − 1 as discussed in the next section, the case α = − 1 and β > − 1 is somewhat more intricate from the viewpoint of the technique of Gurappa Panigrahi. The origin of this difficulty (compare also the results of Gurappa, Panigrahi et al. presented in [36]) resides in the fact that the SJ polynomials for the case α = − 1 and β > − 1 may not be expressed in the form of the exponential of a differential operator acting on a monomial (in contrast to the case α = β = − 1 , see Proposition 4). On the other hand, as evident from the explicit formula as given in (45) (see also [24] and references given therein for further details) for these polynomials, they coincide precisely with the ordinary (monic) Jacobi polynomials (while of course their orthogonality property is a different one). Therefore, while we postpone a more detailed analysis of the connection coefficients for these polynomials to future work, we briefly present a derivation of the EGF for this case, which is based on [2,37].Note first that the results presented in (45) entail that the formula for P ˜ 1 ( − 1 , β ) ( x ) may alternatively be obtained by setting n = 1 in the formulae for P ˜ n ≥ 2 ( − 1 , β ) ( x ) . Making use of the integral transform techniques introduced in Section 2, we may rewrite the formula for P ˜ n ≥ 1 ( − 1 , β ) ( x ) as follows: P ˜ n ≥ 1 ( − 1 , β ) ( x ) = 2 n + β − 1 n − 1 Γ ( n + β + 1 ) ∑ k = 0 n − 1 n − 1 k ( x − 1 ) n − k ( x + 1 ) k Γ ( n − k + 1 ) Γ ( β + k + 1 ) = 2 n + β − 1 n − 1 Γ ( n + β + 1 ) ( x − 1 ) · I ^ ∑ k = 0 n − 1 n − 1 k ( x − 1 ) n − 1 − k ( x + 1 ) k v 1 n − k + 1 v 2 β + k + 1 = 2 n + β − 1 n − 1 Γ ( n + β + 1 ) ( x − 1 ) I ^ v 1 2 v 2 β + 1 v 1 ( x − 1 ) + v 2 ( x + 1 ) n − 1 (55) To formulate generating functions for these polynomials, it will prove convenient to work with a rescaled variant P n ( − 1 , β ) ( x ) of the SJ polynomials P ˜ n ( − 1 , β ) ( x ) , defined as follows: P 0 ( − 1 , β ) ( x ) : = P ˜ 0 ( − 1 , β ) ( x ) = 1 , P n ≥ 1 ( − 1 , β ) ( x ) : = 2 n + β − 1 n 1 Γ ( n + β + 1 ) P ˜ n ≥ 1 ( − 1 , β ) ( x ) (56) with these preparations, it is possible to compute the 1-shifted EGF G P 1 , 1 ( − 1 , β ) ( λ ; x ) of the rescaled SJ polynomials as follows: G P 1 , 1 ( − 1 , β ) ( λ ; x ) : = ∑ n ≥ 0 λ n n ! P n + 1 ( − 1 , β ) ( x ) (57a) = ( x − 1 ) I ^ v 1 2 v 2 β + 1 ∑ n ≥ 0 λ n n ! v 1 ( x − 1 ) + v 2 ( x + 1 ) n (57b) = ( x − 1 ) I ^ v 1 2 v 2 β + 1 e λ v 1 ( x − 1 ) + v 2 ( x + 1 ) (57c) = ∗ ( x − 1 ) I ^ v 1 2 e λ v 1 ( x − 1 ) I ^ v 2 β + 1 e λ v 2 ( x + 1 ) (57d) = ( x − 1 ) C 1 ( − λ ( x − 1 ) ) C β ( − λ ( x + 1 ) ) (57e) here, in the step marked ( ∗ ) , we have made use of Lemma 1, i.e., of the fact that the integrations over v 1 and v 2 are independent of one another. Moreover, in the last step, we defined the auxiliary functions (for a complex parameter α that is non-zero and not equal to a negative integer, α ∈ C \ Z < 0 , and with formal variable z) known as Tricomi-Bessel functions [38] (which are related to the modified Bessel functions of the first kind I α ( x ) as shown below) C α ( − z ) : = ∑ r ≥ 0 z r r ! Γ ( r + α + 1 ) = z − α / 2 I α ( 2 z ) = I ^ v α + 1 e v z (58) Finally, proceeding as above to define a non-shifted EGF for the polynomials P n ( − 1 , β ) ( x ) , we may derive the following (formal) equation: G P 1 , 0 ( − 1 , β ) ( λ ; x ) : = ∑ n ≥ 0 λ n n ! P n ( − 1 , β ) ( x ) (59a) = 1 + λ ( x − 1 ) I ^ v C 1 ( − λ u v ( x − 1 ) ) C β ( − λ u v ( x + 1 ) ) (59b) 5. SJ Polynomials for α = β = − 1 Before proceeding to a detailed study of the SJ polynomials for the parameters α = β = − 1 in the remainder of this paper, we will first introduce several useful technical tools. 5.1. Euler Operators and Normal-Ordering Type TechniquesDenoting by D ^ x : = x ^ ∂ x the Euler operator as before, it is straightforward to derive the following auxiliary normal-ordering type identities:Lemma 2. For any entire function f ≡ f ( D ^ x ) in the Euler operator D ^ x , and for any non-negative integers p , q ∈ Z ≥ 0 , it holds that f ( D ^ x ) x ^ p ∂ x q = x ^ p ∂ x q f ( D ^ x + p − q ) (60a) x ^ p ∂ x q f ( D ^ x ) = f ( D ^ x − p + q ) x ^ p ∂ x q (60b) Proof. Via straightforward computations, applying the above operator formulae to monomials x n . □As a first application, these auxiliary relations allow us to refine the formula for the monic SJ polynomials P ˜ n ( − 1 , − 1 ) ( x ) as follows:Proposition 3. The monic Sobolev-Jacobi polynomials P ˜ n ( − 1 , − 1 ) ( x ) are given in terms of the equivalent exponential formula P ˜ n ( − 1 , − 1 ) ( x ) = e − 1 2 1 D ^ x + n − 1 ∂ x 2 x n (61) Here, the operator in the denominator of (61) is understood as rendered invertible via a suitable completion of its kernel without modifying the final result (compare Proposition 2).Proof. Starting from the original definition of P ˜ n ( − 1 , − 1 ) ( x ) as given in Proposition 2, the claim follows from the following application of Lemma 2: 1 ( D ^ x − n ) ( D ^ x + n − 1 ) ∂ x 2 m x n = ( 60 ) 1 ( D ^ x + n − 1 ) ∂ x 2 m ∏ j = 1 m 1 D ^ x − n − 2 j x n = 1 m ! − 1 2 m 1 ( D ^ x + n − 1 ) ∂ x 2 m x n □ 5.2. Exponential Generating FunctionIt will prove convenient to introduce the following bi-variate polynomials: P n ( x , y ) : = e B ( x y ) n (62) where the differential operator B is defined as B : = b 0 ∂ x 2 , b p : = − 1 2 1 D ^ x + D ^ y + p − 1 ( p ∈ Z ≥ 0 ) (63) As in previous formulae involving operators in denominators, we tacitly employ the same strategy of completing the kernels of these operators by any invertible function such as the identity function on their kernel, thereby rendering them invertible. This entails that in concrete applications, one must check that the resulting formulae are independent of these choices of completions.Returning to the definition of the polynomials P n ( x , y ) as given in (62), we evidently have that P ˜ n ( − 1 , − 1 ) ( x ) = P n ( x , y ) | y → 1 To compute the EGF of the SJ polynomials P ˜ n ( − 1 , − 1 ) ( x ) , we first compute the one of the polynomials P n ( x , y ) —in practice, the fact that the differential operator B does not explicitly depend on the degree n yields a computational advantage, as the following result demonstrates:Proposition 4. The EGF G ( λ ; x , y ) of the polynomials P n ( x , y ) , defined as G ( λ ; x , y ) : = ∑ n ≥ 0 λ n n ! P n ( x , y ) = e B e λ x y (64) has the explicit form G ( λ ; x , y ) = ∑ n ≥ 0 ( λ x y ) n n ! ∑ m ≥ 0 1 m ! − λ 2 y 2 4 m Γ ( m + n − 1 2 ) Γ ( 2 m + n − 1 2 ) (65a) = ∑ n ≥ 0 ( λ x y ) n n ! 1 F 2 n − 1 2 n 2 − 1 4 , n 2 + 1 4 ; − λ 2 y 2 16 (65b) which is one of the key results of this paper.Proof. See Appendix B. □ 5.3. Series Transform Techniques and Sobolev-Jacobi PolynomialsUpon closer inspection, the formula for the EGF of the SJ polynomials as presented in (65) contains in particular a fraction of gamma functions. Expressing these gamma functions via our integral operator I ^ reveals a hidden structure in G ( λ ; x , y ) : G ( λ ; x , y ) = ∑ n ≥ 0 ( λ x y ) n n ! ∑ m ≥ 0 1 m ! − λ 2 y 2 4 m Γ ( m + n − 1 2 ) Γ ( 2 m + n − 1 2 ) (66a) = I ^ ∑ n ≥ 0 ( λ x y ) n n ! ∑ m ≥ 0 1 m ! − λ 2 y 2 4 m u m + n − 1 2 v 2 m + n − 1 2 (66b) = I ^ 1 u v ∑ n ≥ 0 ( λ u v x y ) n n ! ∑ m ≥ 0 1 m ! − λ 2 u v 2 y 2 4 n (66c) whence G ( λ ; x , y ) = I ^ 1 u v e λ ( u v x y ) + λ 2 − u v 2 y 2 4 (67) To proceed, let us recall (see e.g., [39]) the definition of the bi-variate Hermite polynomials H r ( x , z ) , H r ( x , z ) = r ! ∑ m = 0 ⌊ r 2 ⌋ x r − 2 m z m m ! ( r − 2 m ) ! (68) as well as their well-known EGF H ( λ ; x , z ) : = ∑ r ≥ 0 ν r r ! H r ( x , z ) = e ν x + ν 2 z (69) which may be derived from the important operational identity [4,5] H n ( x , z ) = e z ∂ x 2 x n (70) Here, to avoid any potential notational confusion, we have denoted the second variable of the Hermite polynomials H n ( x , z ) by z (rather than y), since in some of our formulae the notation y is used in a different context (i.e., for defining the SJ polynomials).Another useful set of identities is given by ∂ x 2 H n ( x , y ) = ∂ y H n ( x , y ) = ( n ) 2 H n − 2 ( x , y ) (71) with these preparations, we find the following result with far-reaching consequences for the rest of this paper, and which hints at the potential of our novel series transformation methods:Theorem 1. The EGF G ( λ ; x ) is an integral-based series transform of the generating function H ( λ ; x , z ) , G ( λ ; x ) = I ^ 1 u v e ( λ u v ) x + ( λ u v ) 2 − 1 4 u = I ^ 1 u v H λ u v ; x , − 1 4 u (72) This entails the following explicit formula for the monic SJ polynomials P n ( x ) ≡ P ˜ n ( − 1 , − 1 ) ( x ) : = P n ( x , 1 ) : P n ( x ) ≡ P ˜ n ( − 1 , − 1 ) ( x ) = I ^ ( u v ) n − 1 2 H n ( x , − 1 4 u ) = I ^ 1 u v e − 1 4 u ∂ x 2 ( x u v ) n (73) In practice, employing the definitions of Section 2, Formula (73) allows for an efficient computation of the explicit forms of the SJ polynomials. The evaluated explicit formulae for the first few polynomials are presented in Table A1. 5.4. Aside: General Operational Definitions for Calculating Lacunary Generating FunctionsSuppose we were given the EGF G ( λ ; x ) of some set of polynomials p n ( x ) (where n ∈ Z ≥ 0 , and where we assume d e g r e e ( p n ( x ) ) = n ). We will be particularly interested in the relationship between the following two forms of presenting G ( λ ; x ) as a formal power series: G ( λ ; x ) = ∑ n ≥ 0 λ n n ! p n ( x ) (74a) = ∑ n ≥ 0 x n ∑ m ≥ 0 λ m + n n ! g n , m (74b) In certain situations, one might be interested in so-called lacunary generating functions:Definition 3. Given an EGF G ( λ ; x ) = ∑ n ≥ 0 λ n n ! p n ( x ) , theK-tuple L-shifted lacunary generating function G K , L ( λ ; x ) of the polynomials p n ( x ) is defined as (for K ∈ Z ≥ 1 and L ∈ Z ≥ 0 ) G K , L : = ∑ n ≥ 0 λ n n ! p K · n + L ( x ) (75) Thus, in particular G 1 , 0 ( λ ; x ) = G ( λ ; x ) .The difficulty in explicit calculations of lacunary generating functions resides in finding the explicit coefficient form as indicated in (74b). The series transform methods presented thus far allow to cast these computations into a concise operational form:Lemma 3. Let G ( λ ; x ) be an EGF, K ∈ Z ≥ 1 and L ∈ Z ≥ 0 integer parameters and η K : = e 2 π i K (76) a K-th root of unity ( ( η K ) K = 1 ). Then the lacunary generating function G K , L ( λ ; x ) is given by G K , L ( λ ; x ) = L ( K ) ∘ ∂ ∂ λ L G ( λ ; x ) (77) here, the lacunary dilatation operator L ( K ) is defined as acting on a generic formal power series F ( λ ; x ) as L ( K ) F ( λ ; x ) : = I ^ u v k ∑ j = 0 K − 1 F η K j u ( v λ ) 1 K ; x (78) Moreover, the following relations hold: ∂ ∂ λ L ∘ L ( K ) = L ( K ) ∘ ∂ ∂ λ K · L (79) Proof. The first (well-known) part of the claim follows from ∂ ∂ λ L G ( λ ; x ) = ∑ n ≥ L λ n − L ( n − L ) ! p n ( x ) = ∑ n ≥ 0 λ n n ! p n + L ( x ) = G 1 , L ( λ ; x ) (80) To prove the formula for the action of L ( K ) on a generic formal power series F ( λ ; x ) , note first that for k > 1 1 K ∑ j = 0 K − 1 ( η K n ) j = 1 K ∑ j = 0 K − 1 1 if n mod K = 0 1 K η K K − 1 η K − 1 else = δ ( n mod K ) , 0 (81) and that by definition for all K ∈ Z ≥ 1 and n ∈ Z ≥ 0 , I ^ u v ( u v 1 K ) n = Γ ( n + 1 ) Γ ( n K + 1 ) (82) Whence for an EGF G ( λ ; x ) = ∑ n ≥ 0 λ n n ! p n ( x ) , the application of L ( K ) results in L ( K ) G ( λ ; x ) = I ^ ∑ n ≥ 0 λ n n ! p n ( x ) u n + 1 v 1 K + 1 1 K ∑ j = 0 K − 1 η K n j = ∑ n ≥ 0 λ n n ! p n ( x ) Γ ( n + 1 ) Γ ( n K + 1 ) δ ( n mod K ) , 0 = ∑ r ≥ 0 λ r r ! p r · K ( x ) = G K , 0 ( λ ; x ) (83) Finally, the relations presented (79) follow directly from the definitions. □The readers will notice the similarity of the definition given in (78) with the technique of so-called multisection of series [40]. However, the presence of the operator I ^ enriches this technique in a substantial way. For comparison, we refer the interested readers to our recent work [41] for an alternative, but equivalent definition of the lacunary dilatation operator L ( K ) . 5.5. Lacunary Exponential Generating Functions for the SJ Polynomials for the Case α = β = − 1 While it may not be immediately evident, the true merit of the definition of the lacunary dilatation and shift operators L ( K ) and ∂ λ is revealed upon applying them to computations of the EGF forms described in (74b) for the case of an EGF G ( λ ; x ) . Some of the authors of the present paper [41] recently applied these ideas to the computation of explicit formulae for all lacunary generating functions H K , L ( λ ; x , z ) (with K ∈ Z ≥ 1 and L ∈ Z ≥ 0 ) of the two-variable Hermite polynomials H n ( x , y ) . We quote the respective results in Appendix C for the interested readers’ convenience.For the present paper, we would like to focus on the interaction of series transforms with generating function formulae. More concretely, we will present an immediate consequence of this general theorem for the lacunary generating functions of the Hermite polynomials in terms of the corresponding generating functions of the SJ polynomials. As a tool that we will frequently invoke in the following considerations, let us recall the Gauss-Legendre multiplication formula ([26], Equation (5.5.6)) for Gamma functions (for n · z ∉ Z ≤ 0 ), Γ ( n z ) = n n z − 1 2 ( 2 π ) ( 1 − n ) 2 ∏ j = 0 n − 1 Γ z + j n (84) More precisely, we will make use of the following variant of this formula: for n ( s + x ) , n x ∈ C \ Z ≤ 0 , n ∈ Z ≥ 2 and s ∈ Z ≥ 0 , we have that Γ ( n ( s + x ) ) = n s · n Γ ( n x ) ∏ j = 0 n − 1 x + j n s (85) with the Pochhammer symbol ( a ) b defined according to the convention ( a ) b : = Γ ( a + b ) Γ ( a ) To compute the lacunary generating functions G K , L ( λ ; x ) of the SJ polynomials P ˜ n ( − 1 , − 1 ) ( x ) , we merely have to apply Theorem 1 to the results presented in Theorem A1. More precisely, introducing the notations h r , m ( K , L ) ( z ) for the expansion coefficients of the generating functions H K , L ( λ ; x , z ) and g r , m ( K , L ) ( z ) of the generating functions G K , L ( λ ; x ) , respectively, H K , L ( λ ; x , z ) = ∑ r ≥ 0 x r ∑ m ≥ 0 λ r + m ( r + m ) ! h r , m ( K , L ) ( z ) G K , L ( λ ; x ) = ∑ r ≥ 0 x r ∑ m ≥ 0 λ r + m ( r + m ) ! g r , m ( K , L ) (86) we find the following precise relationship between the generating functions H K , L ( λ ; x ) and G K , L ( λ ; x , z ) :Corollary 1. For all K ∈ Z ≥ 1 and L ∈ Z ≥ 0 , the lacunary generating functions G K , L ( λ ; x ) of the SJ polynomials P n ( x ) ≡ P ˜ n ( − 1 , − 1 ) ( x ) and H K , L ( λ ; x , z ) of the Hermite polynomials H n ( x , z ) are related according to G K , L ( λ ; x ) = I ^ ( u v ) L − 1 2 H K , L λ ( u v ) K ; x , − 1 4 u (87) On the level of expansion coefficients, this entails that g r , m ( K , L ) = I ^ ( u v ) K · ( r + m ) + L − 1 2 h r , m ( K , L ) − 1 4 u (88) Proof. The proof follows from inserting the expression given for P n ( X ) in (73) into the defining equation of the lacunary generating function G K , L ( λ ; x ) , and for analogously for the expansion coefficients as specified in (86). □Finally, we will need the following auxiliary statement (throughout which we will consider z as a formal variable to avoid any issues of convergence, compare ([26], §16.2), according to which in particular all generalized hypergeometric series with p > q + 1 are divergent):Lemma 4 (“Pochhammer proliferation”). For parameters α , β ∈ C \ Z ≤ 0 and r , s ∈ Z ≥ 1 , the following series transformation yields in effect a “proliferation of Pochhammer symbols”: I ^ u α v β p F q ( a j ) 1 ≤ j ≤ p ( b ℓ ) 1 ≤ ℓ ≤ q ; z u r v s = Γ ( α ) Γ ( β ) p + r F q + s ( a j ) 1 ≤ j ≤ p , ( α + k r ) 0 ≤ k ≤ r − 1 ( b ℓ ) 1 ≤ ℓ ≤ q , ( β + t s ) 0 ≤ t ≤ s − 1 ; z r r s s (89) Proof. The proof follows via a straightforward application of (85): I ^ u α v β p F q ( a j ) 1 ≤ j ≤ p ( b ℓ ) 1 ≤ ℓ ≤ q ; z u r v s = ∑ m ≥ 0 z m m ! ∏ j = 1 p ( a j ) m ∏ ℓ = 1 q ( b q ) m I ^ u α + m · r v β + m · s = ∑ m ≥ 0 z m m ! ∏ j = 1 p ( a j ) m ∏ ℓ = 1 q ( b q ) m Γ ( m · r + α ) Γ ( m · s + β ) = ∑ m ≥ 0 z m m ! ∏ j = 1 p ( a j ) m ∏ ℓ = 1 q ( b q ) m Γ ( α ) ( α ) m · r Γ ( β ) ( β ) m · s = ( 85 ) ∑ m ≥ 0 z m m ! ∏ j = 1 p ( a j ) m ∏ ℓ = 1 q ( b q ) m Γ ( α ) Γ ( β ) ( r r ) m ∏ k = 0 r − 1 α + k r m ( s s ) m ∏ t = 0 s − 1 β + t s m = Γ ( α ) Γ ( β ) p + r F q + s ( a j ) 1 ≤ j ≤ p , ( α + k r ) 0 ≤ k ≤ r − 1 ( b ℓ ) 1 ≤ ℓ ≤ q , ( β + t s ) 0 ≤ t ≤ s − 1 ; z r r s s □Making use of the results for the lacunary generating functions of the Hermite polynomials H n ( x , y ) and of all of the corollaries and lemmata presented thus far, we are finally in a position to derive the following closed-form results for all lacunary generating functions of the SJ polynomials P n ( x ) ≡ P ˜ n ( − 1 , − 1 ) ( x ) . To the best of our knowledge, all these formulae appear to be new.Theorem 2 (All-order lacunary generating functions for the SJ polynomials). For integer parameters K ∈ Z ≥ 1 , denote by G K ( μ ; λ ; x ) : = ∑ L ≥ 0 μ L L ! G K , L ( λ ; x ) (90) the EGF of lacunary shifts of the lacunary generating functions G K , 0 ( λ ; x ) . Then G K ( μ ; λ ; x ) is given by G K ( μ ; λ ; x ) = I ^ 1 u v e μ u v x − μ 2 u v 2 4 H K , 0 λ ( u v ) K ; x − μ v 2 , − 1 4 u (91) which permits (making use of “Pochhammer proliferation”, Lemma 4 and the explicit formulae for H k , 0 ( λ ; x , y ) presented in Theorem A1) to calculate arbitrary L-fold lacunary shifted generating functions G K , L ( λ ; x ) . In particular, the explicit formulae for L = 0 read in the case K = 2 T (for T ∈ Z ≥ 1 ) G K = 2 T , 0 ( λ ; x ) = ∑ β = 0 T − 1 ∑ s ≥ 0 λ s s ! x K · s − 2 β − 1 4 β h ˜ K · s , β Γ ( K · s − β − 1 2 ) Γ ( K · s − 1 2 ) · ( 3 T − 1 ) F ( 3 T − 1 ) ( s + j + 1 K ) 0 ≤ j ≤ K − 2 , ( 2 s + 2 m − β − 1 K ) 0 ≤ m ≤ T − 1 ( β + ℓ + 1 T ) 0 ≤ ℓ ≤ T − 1 ℓ ≠ T − 1 − β , ( s + 2 t − 1 2 K ) 0 ≤ t ≤ K − 1 ; λ − 1 4 T (92) and in the case K = 2 T + 1 (for T ∈ Z ≥ 0 ) G K = 2 T + 1 , 0 ( λ ; x ) = ∑ β = 1 K − 1 ∑ s ≥ 0 λ s s ! x K · s − 2 β − 1 4 β h ˜ K · s , β Γ ( K · s − β − 1 2 ) Γ ( K · s − 1 2 ) · ( 3 K − 2 ) F ( 3 K − 1 ) s 2 + j + 1 2 K 0 ≤ j ≤ 2 K − 2 j ≠ K − 1 , s + 2 m − 2 β − 1 2 K 0 ≤ m ≤ K − 1 β + ℓ + 1 K 0 ≤ ℓ ≤ K − 1 ℓ ≠ K − 1 − β , s 2 + 2 t − 1 4 K 0 ≤ t ≤ 2 K − 1 ; − λ 2 4 K + 1 (93) here, h ˜ n , k denote the so-called matching coefficients (of directed Hermite-configurations), h ˜ n , k : = n ! ( n − 2 k ) ! k ! i f 0 ≤ 2 k ≤ n 0 o t h e r w i s e (94) Proof. While (92) and (93) follow directly from Theorem A1, Corollary 1 and Lemma 4, it remains to prove (91), whence the formula for the generating functions G K ( μ ; λ ; x ) of the L-fold lacunary shifts of the K-tuple lacunary generating functions G K , L ( λ ; x ) . Recall from Appendix C, Equation (A10) the corresponding formula for the Hermite polynomials (where for later convenience we rename the formal variable that was denoted μ in (A10) to σ), H K ( σ ; λ ; x , z ) : = ∑ L ≥ 0 σ L L ! H K , L ( λ ; x , z ) = e σ x + σ 2 z H K , 0 ( λ ; x + 2 σ z , z ) (95) Since accordingly H K , L ( λ ; x , z ) = ∂ L ∂ σ L H K ( σ ; λ ; x , z ) | σ → 0 = ∂ L ∂ σ L e σ x + σ 2 z H K , 0 ( λ ; x + 2 σ z , z ) | σ → 0 (96) Combining this result with the result of (87) on the relationship of G K , L ( λ ; x ) and H K , L ( λ ; x , z ) into the defining Equation (90) for G K ( μ ; λ ; x ) , we obtain G K ( μ ; λ ; x ) = ( 90 ) ∑ L ≥ 0 μ L L ! G K , L ( λ ; x ) = ( 87 ) ∑ L ≥ 0 μ L L ! I ^ ( u v ) L − 1 2 H K , L λ ( u v ) K ; x , − 1 4 u = ( 96 ) I ^ 1 u v ∑ L ≥ 0 ( μ u v ) L L ! ∂ L ∂ σ L e σ x − σ 2 4 u H K , 0 ( λ ( u v ) K ; x − σ 2 u , − 1 4 u ) | σ → 0 = I ^ 1 u v e ( μ u v ) ∂ ∂ σ e σ x − σ 2 4 u H K , 0 ( λ ( u v ) K ; x − σ 2 u , − 1 4 u ) | σ → 0 = ( ∗ ) I ^ 1 u v e ( σ + μ u v ) x − ( σ + μ u v ) 2 4 u H K , 0 ( λ ( u v ) K ; x − ( σ + μ u v ) 2 u , − 1 4 u ) | σ → 0 = I ^ 1 u v e μ u v x − μ 2 u v 2 4 H K , 0 λ ( u v ) K ; x − μ v 2 , − 1 4 u (97) here, in the step marked ( ∗ ) , we have made use of Taylor’s formula, e α ∂ ∂ σ f ( σ ) = f ( σ + α ) . □For illustration, we present several examples for lacunary generating functions G K , L ( λ ; x , y ) in Table A2. 5.6. Connection Coefficients for SJ Polynomials for the Case α = β = − 1 Consider the so-called connection coefficients A M , n of the SJ polynomials P ˜ n ( − 1 , − 1 ) ( x ) (see [24] for an explicit solution in terms of integral computations), which are defined for non-negative integers M and n as x M = ∑ n = 0 M A M , n P ˜ n ( − 1 , − 1 ) ( x ) (98) In this section, we will highlight some aspects of computations related to these coefficients in terms of operational techniques. To this end, we first derive the connection coefficients for the two-variable Hermite polynomials H n ( x , y ) [2]: H M ( x , y ) = e y ∂ x 2 x M ⇒ x M = e − y ∂ x 2 H M ( x , y ) = ∑ n = 0 ⌊ M 2 ⌋ ( − y ) n n ! ∂ x 2 n H M ( x , y ) = ( 71 ) ∑ n = 0 ⌊ M 2 ⌋ ( − y ) n M ! n ! ( M − 2 n ) ! H M − 2 n ( x , y ) ≡ ∑ n ≥ 0 a M , n ( y ) H n ( x , y ) (99) In consequence, the generating function for the connection coefficients a M , n ( y ) of the polynomials H n ( x , y ) reads A H ( λ , μ ; y ) : = ∑ M , n ≥ 0 λ M M ! μ n a M , n ( y ) = ∑ M ≥ 0 λ M M ! ∑ n = 0 ⌊ M 2 ⌋ M ! μ M − 2 n ( − y ) n n ! ( M − 2 n ) ! = ( 68 ) ∑ M ≥ 0 λ M M ! H M ( μ , − y ) = ( 69 ) e λ μ − λ 2 y (100) For later convenience, let us also consider a consistency check for this result involving the EGF B H ( x , y ) for the two-variable Hermite polynomials, B H ( λ , μ ; y ) : = ∑ n ≥ 0 λ n n ! H n ( μ , y ) ≡ ∑ n , M ≥ 0 λ n n ! μ M b n , M ( y ) = e λ μ + λ 2 y (101) Making use of the well-known integral formula (for w a complex variable and d 2 w ≡ d w d w ¯ ) 1 π ∫ d 2 w e − | w | 2 w r w ¯ s = r ! δ r , s (102) the generating functions A H ( λ , μ ; y ) and B H ( λ , μ ; y ) verify the following property: 1 π ∫ d w e − | W | 2 A H ( α , w ; y ) B H ( w ¯ , β ; y ) = e α β (103) This is of course nothing else but a direct consequence of the defining property of the coefficients a M , n ( y ) and b n , M ( y ) , namely x M = ∑ n ≥ 0 a M , n ( y ) H n ( x , y ) = ∑ n , L ≥ 0 a M , n ( y ) b n , L ( y ) x L ⇒ ∑ n ≥ 0 a M , n ( y ) b n , L ( y ) = δ M , L (104) with these preparations, let us quote from [24] the explicit formula for the connection coefficients A M , n of the SJ polynomials P n ( x ) ≡ P ˜ n ( − 1 , − 1 ) ( x ) (note however the change of notations compared to [24], i.e., A M , n ≡ B − 1 M , n ): A M , n = 2 n n M ! M + n 2 ! ( M + n ) ! M − n 2 ! if M + n ∈ 2 Z and n ≤ M 0 else (105) By analogy with the two-variable Hermite polynomial case, let us define the generating function A ( λ , μ ) of these coefficients. Making use of the identity Γ ( m + 1 2 ) = π ( 2 m ) ! 4 m m ! we first rewrite the coefficients A M , M − 2 n as A M , M − 2 n = 2 M − 4 n M − 2 n M ! ( M − n ) ! ( 2 ( M − p ) ) ! p ! = M ! n ! ( M − 2 n ) ! Γ ( M − 2 n + 1 2 ) 4 n Γ ( M − n + 1 2 ) = M ! n ! ( M − 2 n ) ! I ^ ( u v ) M − 2 n + 1 2 v 4 n (106) We thus obtain a result reminiscent of the two-variable Hermite polynomial case for the generating function of the connection coefficients A M , n : A ( λ , μ ) : = ∑ M , n ≥ 0 λ M M ! μ n A M , n = I ^ u v ∑ M ≥ 0 λ M M ! H ( μ u v , v 4 ) = I ^ u v e λ μ u v + λ 2 v 4 = I ^ ∑ M ≥ 0 ( λ μ ) M M ! ( u v ) M + 1 2 e λ 2 v 4 = ( 17 ) ∑ M ≥ 0 ( λ μ ) M M ! 0 F 1 ( M + 1 2 ; λ 2 4 ) (107) While we were not able to derive this result purely via operational methods, but only by making use of the explicit formula provided in [24] for the connection coefficients A M , n , the operational methods will nonetheless allow us to provide an independent verification of this explicit formula. To this end, introduce the notation (compare (72)) B ( λ , μ ) : = G ( λ ; μ ) = I ^ 1 u v e λ μ u v + λ 2 − u v 2 4 The generating functions A ( λ , μ ) and B ( λ , μ ) verify 1 π ∫ d 2 w e − | w | 2 A ( α , w ) B ( w ¯ , β ) = e α β (108) Proof. See Appendix D. □ 6. ConclusionsIn this paper, we have applied operational methods to the study of SJ polynomials. We have implemented, starting from first principles, a variant of multi-variate umbral calculus in the form of a certain integral transform technique based on the notions of generalized monomials and on the elementary integrals defining the special functions Γ ( z ) and 1 / Γ ( z ) (cf. Section 2). Our approach provides a bridge between the plethora of results and specialized techniques known from the umbral calculus literature and more conventional mathematical techniques of elementary algebra and calculus, which we hope will allow a wider audience to profit from this fruitful approach. To apply our technique to the study of SJ polynomials, we adapted a remarkable method invented by Gurappa and Panigrahi [16,17,18,33,34,35] (cf. Section 3) as well as a certain generalized normal-ordering technique (for expressions involving Euler operators and fractions thereof, cf. Section 5.1). We have achieved not only a deeper understanding of the Sobolev-Jacobi polynomials for parameters α = β = − 1 as umbral images of the two-variable Hermite polynomials H n ( x , y ) (see Theorem 1), but were in consequence in particular able to derive explicit formulae for all K-tuple L-shifted lacunary exponential generating functions (see Theorem 2) for these SJ polynomials (based on a previous work [41] on lacunary EGFs for the bi-variate Hermite polynomials). A crucial step in this derivation consisted of a technical Lemma called “Pochhammer Proliferation Lemma” (See Lemma 4), which highlights the strengths of our integral transform techniques and fully explains the explicit structure of the lacunary EGFs as formal power series over certain generalized hypergeometric functions. To the best of our knowledge, these results have not been known before in the literature. Additional results include an explicit formula for the connection coefficients of the aforementioned family of SJ polynomials (cf. Section 5.6), a derivation of the EGFs for the remaining family of SJ polynomials (cf. Section 4), and finally several auxiliary results and examples (cf. Section 2) that illustrate our novel umbral calculus-type integral transform techniques, and which highlight a certain resemblance with earlier ideas as expressed in [22,23] (referred to therein as the “principle” of permanence of formal properties). The results we have obtained appear to be promising and seem to offer new and interesting developments within the framework of the theory of special functions and of the relevant applications. A forthcoming investigation, along the lines suggested here, will be devoted to further progress towards a unified theory of Legendre-like polynomials. Author ContributionsConceptualization, N.B.; Methodology, N.B., G.D., G.H.E.D., K.A.P.; Formal analysis, N.B.; Writing: Original Draft Preparation, N.B.; Writing: Review & Editing, N.B., G.D., G.H.E.D., S.L., K.A.P.FundingThe work of N.B. was supported by a H2020 Marie Skłodowska-Curie Actions Individual Fellowship (grant # 753750—RaSiR).AcknowledgmentsN.B. would like to thank the LPTMC (Paris 06) and ENEA Frascati for warm hospitality.Conflicts of InterestThe authors declare no conflict of interest. The founding sponsors had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, and in the decision to publish the results. Appendix A. Details of the Derivation of the Sobolev-Jacobi PolynomialsFollowing Gurappa and Panigrahi [16,17,18,33,34,35], writing the defining eigenequation (37) in explicit form, one may collect the terms in the following form (note however the systematic typographical error in loc. cit. in the definition of the diagonal part, compare e.g., [35]): 0 = ( D ^ J a c ( α , β ) − ( − n ( n + α + β + 1 ) ) ) P ˜ n ( α , β ) ( x ) = ( 1 − x ^ 2 ) ∂ x 2 + ( β − α − ( α + β + 2 ) x ) ∂ x + n ( n + α + β + 1 ) P ˜ n ( α , β ) ( x ) = − x ^ 2 ∂ x 2 − ( α + β + 2 ) x ^ ∂ x + n ( n + α + β + 1 ) + ∂ x 2 + ( β − α ) ∂ x P ˜ n ( α , β ) ( x ) = ( ∗ ) − D ^ x 2 + D ^ x − ( α + β + 2 ) D ^ x + n ( n + α + β + 1 ) + ∂ x 2 + ( β − α ) ∂ x P ˜ n ( α , β ) ( x ) = − ( D ^ x + n + α + β + 1 ) D ^ x + n D ^ x + n ( n + α + β + 1 ) + ∂ x 2 + ( β − α ) ∂ x P ˜ n ( α , β ) ( x ) = − ( D ^ x + n + α + β + 1 ) ( D ^ x − n ) + ∂ x 2 + ( β − α ) ∂ x P ˜ n ( α , β ) ( x ) = ( F n ( α , β ) ( D ^ x ) + N ( x ^ , ∂ x ) ) P ˜ n ( α , β ) ( x ) (A1) In the step marked ( ∗ ) , we made use of the definition D ^ x = x ^ ∂ x as well as of the auxiliary relation x ^ 2 ∂ x 2 = D ^ x 2 − D ^ x (see (48)). Table A1. Sobolev-Jacobi polynomials P ˜ n ( − 1 , − 1 ) ( x ) and bi-variate Hermite polynomials H n ( x , y ) . Table A1. Sobolev-Jacobi polynomials P ˜ n ( − 1 , − 1 ) ( x ) and bi-variate Hermite polynomials H n ( x , y ) . n P ˜ n ( − 1 , − 1 ) ( x ) H n ( x , y ) 0111xx2 x 2 − 1 x 2 + 2 y 3 x 3 − x x 3 + 6 x y 4 x 4 − 6 x 2 5 + 1 5 x 4 + 12 x 2 y + 12 y 2 5 x 5 − 10 x 3 7 + 3 x 7 x 5 + 20 x 3 y + 60 x y 2 6 x 6 − 5 x 4 3 + 5 x 2 7 − 1 21 x 6 + 30 x 4 y + 180 x 2 y 2 + 120 y 3 7 x 7 − 21 x 5 11 + 35 x 3 33 − 5 x 33 x 7 + 42 x 5 y + 420 x 3 y 2 + 840 x y 3 8 x 8 − 28 x 6 13 + 210 x 4 143 − 140 x 2 429 + 5 429 x 8 + 56 x 6 y + 840 x 4 y 2 + 3360 x 2 y 3 + 1680 y 4 9 x 9 − 12 x 7 5 + 126 x 5 65 − 84 x 3 143 + 7 x 143 x 9 + 72 x 7 y + 1512 x 5 y 2 + 10080 x 3 y 3 + 15120 x y 4 10 x 10 − 45 x 8 17 + 42 x 6 17 − 210 x 4 221 + 315 x 2 2431 − 7 2431 x 10 + 90 x 8 y + 2520 x 6 y 2 + 25200 x 4 y 3 + 75600 x 2 y 4 + 30240 y 5 Table A2. Lacunary generating functions G K , L ( λ ; x ) for the SJ polynomials P n ( x ) and K = 1 , … , 5 and some selected values of L ∈ Z ≥ 0 . Table A2. Lacunary generating functions G K , L ( λ ; x ) for the SJ polynomials P n ( x ) and K = 1 , … , 5 and some selected values of L ∈ Z ≥ 0 . G K , 0 ( λ ; x ) = ∑ n ≥ 0 λ n n ! P n · K ( x ) G 1 , 0 ( λ ; x ) = ∑ s ≥ 0 λ s s ! x s 1 F 2 s − 1 2 s 2 − 1 4 , s 2 + 1 4 ; − λ 2 16 G 2 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 2 s 2 F 2 s + 1 2 , 2 s − 1 2 s − 1 4 , s + 1 4 ; − λ 4 G 2 , 1 ( λ ; x ) = ∑ s ≥ 0 λ s s ! x 2 s + 1 2 F 2 s + 3 2 , 2 s + 1 2 s + 1 4 , s + 3 4 ; − λ 4 G 3 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 3 s 7 F 8 s 2 + 1 6 , s 2 + 1 3 , s 2 + 2 3 , s 2 + 5 6 , s − 1 6 , s + 1 6 , s + 1 2 1 3 , 2 3 , s 2 − 1 12 , s 2 + 1 12 , s 2 + 1 4 , s 2 + 5 12 , s 2 + 7 12 , s 2 + 3 4 ; − λ 2 256 − ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 3 ( s + 1 ) − 2 Γ 3 ( s + 1 ) − 3 2 4 Γ 3 ( s + 1 ) − 1 2 ( 3 ( s + 1 ) ) ! ( 3 ( s + 1 ) − 2 ) ! · 7 F 8 s + 1 2 + 1 6 , s + 1 2 + 1 3 , s + 1 2 + 2 3 , s + 1 2 + 5 6 , ( s + 1 ) − 1 2 , ( s + 1 ) − 1 6 , ( s + 1 ) + 1 6 2 3 , 4 3 , s + 1 2 − 1 12 , s + 1 2 + 1 12 , s + 1 2 + 1 4 , s + 1 2 + 5 12 , s + 1 2 + 7 12 , s + 1 2 + 3 4 ; − λ 2 256 + ∑ s = 0 ∞ λ s + 2 ( s + 2 ) ! x 3 ( s + 2 ) − 4 Γ 3 ( s + 2 ) − 5 2 16 Γ 3 ( s + 2 ) − 1 2 ( 3 ( s + 2 ) ) ! 2 ! ( 3 ( s + 2 ) − 4 ) ! · 7 F 8 s + 2 2 + 1 6 , s + 2 2 + 1 3 , s + 2 2 + 2 3 , s + 2 2 + 5 6 , ( s + 2 ) − 5 6 , ( s + 2 ) − 1 2 , ( s + 2 ) − 1 6 4 3 , 5 3 , s + 2 2 − 1 12 , s + 2 2 + 1 12 , s + 2 2 + 1 4 , s + 2 2 + 5 12 , s + 2 2 + 7 12 , s + 2 2 + 3 4 ; − λ 2 256 G 4 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 4 s 5 F 5 s + 1 4 , s + 1 2 , s + 3 4 , 2 s − 1 4 , 2 s + 1 4 1 2 , s − 1 8 , s + 1 8 , s + 3 8 , s + 5 8 ; λ 16 − ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 4 ( s + 1 ) − 2 Γ 4 ( s + 1 ) − 3 2 4 Γ 4 ( s + 1 ) − 1 2 ( 4 ( s + 1 ) ) ! ( 4 ( s + 1 ) − 2 ) ! · 5 F 5 ( s + 1 ) + 1 4 , ( s + 1 ) + 1 2 , ( s + 1 ) + 3 4 , 2 ( s + 1 ) − 3 4 , 2 ( s + 1 ) − 1 4 3 2 , ( s + 1 ) − 1 8 , ( s + 1 ) + 1 8 , ( s + 1 ) + 3 8 , ( s + 1 ) + 5 8 ; λ 16 G 5 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 5 s 13 F 14 s 2 + 1 10 , s 2 + 1 5 , s 2 + 3 10 , s 2 + 2 5 , s 2 + 3 5 , s 2 + 7 10 , s 2 + 4 5 , s 2 + 9 10 , s − 1 10 , s + 1 10 , s + 3 10 , s + 1 2 , s + 7 10 1 5 , 2 5 , 3 5 , 4 5 , s 2 − 1 20 , s 2 + 1 20 , s 2 + 3 20 , s 2 + 1 4 , s 2 + 7 20 , s 2 + 9 20 , s 2 + 11 20 , s 2 + 13 20 , s 2 + 3 4 , s 2 + 17 20 ; − λ 2 4096 − ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 5 ( s + 1 ) − 2 Γ 5 ( s + 1 ) − 3 2 4 Γ 5 ( s + 1 ) − 1 2 ( 5 ( s + 1 ) ) ! ( 5 ( s + 1 ) − 2 ) ! · 13 F 14 s + 1 2 + 1 10 , s + 1 2 + 1 5 , s + 1 2 + 3 10 , s + 1 2 + 2 5 , s + 1 2 + 3 5 , s + 1 2 + 7 10 , s + 1 2 + 4 5 , s + 1 2 + 9 10 , ( s + 1 ) − 3 10 , ( s + 1 ) − 1 10 , ( s + 1 ) + 1 10 , ( s + 1 ) + 3 10 , ( s + 1 ) + 1 2 2 5 , 3 5 , 4 5 , 6 5 , s + 1 2 − 1 20 , s + 1 2 + 1 20 , s + 1 2 + 3 20 , s + 1 2 + 1 4 , s + 1 2 + 7 20 , s + 1 2 + 9 20 , s + 1 2 + 11 20 , s + 1 2 + 13 20 , s + 1 2 + 3 4 , s + 1 2 + 17 20 ; − λ 2 4096 + ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 5 ( s + 1 ) − 4 Γ 5 ( s + 1 ) − 5 2 16 Γ 5 ( s + 1 ) − 1 2 ( 5 ( s + 1 ) ) ! 2 ! ( 5 ( s + 1 ) − 4 ) ! · 13 F 14 s + 1 2 + 1 10 , s + 1 2 + 1 5 , s + 1 2 + 3 10 , s + 1 2 + 2 5 , s + 1 2 + 3 5 , s + 1 2 + 7 10 , s + 1 2 + 4 5 , s + 1 2 + 9 10 , ( s + 1 ) − 1 2 , ( s + 1 ) − 3 10 , ( s + 1 ) − 1 10 , ( s + 1 ) + 1 10 , ( s + 1 ) + 3 10 3 5 , 4 5 , 6 5 , 7 5 , s + 1 2 − 1 20 , s + 1 2 + 1 20 , s + 1 2 + 3 20 , s + 1 2 + 1 4 , s + 1 2 + 7 20 , s + 1 2 + 9 20 , s + 1 2 + 11 20 , s + 1 2 + 13 20 , s + 1 2 + 3 4 , s + 1 2 + 17 20 ; − λ 2 4096 − ∑ s = 0 ∞ λ s + 2 ( s + 2 ) ! x 5 ( s + 2 ) − 6 Γ 5 ( s + 2 ) − 7 2 64 Γ 5 ( s + 2 ) − 1 2 ( 5 ( s + 2 ) ) ! 3 ! ( 5 ( s + 2 ) − 6 ) ! · 13 F 14 s + 2 2 + 1 10 , s + 2 2 + 1 5 , s + 2 2 + 3 10 , s + 2 2 + 2 5 , s + 2 2 + 3 5 , s + 2 2 + 7 10 , s + 2 2 + 4 5 , s + 2 2 + 9 10 , ( s + 2 ) − 7 10 , ( s + 2 ) − 1 2 , ( s + 2 ) − 3 10 , ( s + 2 ) − 1 10 , ( s + 2 ) + 1 10 4 5 , 6 5 , 7 5 , 8 5 , s + 2 2 − 1 20 , s + 2 2 + 1 20 , s + 2 2 + 3 20 , s + 2 2 + 1 4 , s + 2 2 + 7 20 , s + 2 2 + 9 20 , s + 2 2 + 11 20 , s + 2 2 + 13 20 , s + 2 2 + 3 4 , s + 2 2 + 17 20 ; − λ 2 4096 + ∑ s = 0 ∞ λ s + 2 ( s + 2 ) ! x 5 ( s + 2 ) − 8 Γ 5 ( s + 2 ) − 9 2 256 Γ 5 ( s + 2 ) − 1 2 ( 5 ( s + 2 ) ) ! 4 ! ( 5 ( s + 2 ) − 8 ) ! · 13 F 14 s + 2 2 + 1 10 , s + 2 2 + 1 5 , s + 2 2 + 3 10 , s + 2 2 + 2 5 , s + 2 2 + 3 5 , s + 2 2 + 7 10 , s + 2 2 + 4 5 , s + 2 2 + 9 10 , ( s + 2 ) − 9 10 , ( s + 2 ) − 7 10 , ( s + 2 ) − 1 2 , ( s + 2 ) − 3 10 , ( s + 2 ) − 1 10 6 5 , 7 5 , 8 5 , 9 5 , s + 2 2 − 1 20 , s + 2 2 + 1 20 , s + 2 2 + 3 20 , s + 2 2 + 1 4 , s + 2 2 + 7 20 , s + 2 2 + 9 20 , s + 2 2 + 11 20 , s + 2 2 + 13 20 , s + 2 2 + 3 4 , s + 2 2 + 17 20 ; − λ 2 4096 G 6 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 6 s 8 F 8 s + 1 6 , s + 1 3 , s + 1 2 , s + 2 3 , s + 5 6 , 2 s − 1 6 , 2 s + 1 6 , 2 s + 1 2 1 3 , 2 3 , s − 1 12 , s + 1 12 , s + 1 4 , s + 5 12 , s + 7 12 , s + 3 4 ; − λ 64 − ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 6 ( s + 1 ) − 2 Γ 6 ( s + 1 ) − 3 2 4 Γ 6 ( s + 1 ) − 1 2 ( 6 ( s + 1 ) ) ! ( 6 ( s + 1 ) − 2 ) ! · 8 F 8 ( s + 1 ) + 1 6 , ( s + 1 ) + 1 3 , ( s + 1 ) + 1 2 , ( s + 1 ) + 2 3 , ( s + 1 ) + 5 6 , 2 ( s + 1 ) − 1 2 , 2 ( s + 1 ) − 1 6 , 2 ( s + 1 ) + 1 6 2 3 , 4 3 , ( s + 1 ) − 1 12 , ( s + 1 ) + 1 12 , ( s + 1 ) + 1 4 , ( s + 1 ) + 5 12 , ( s + 1 ) + 7 12 , ( s + 1 ) + 3 4 ; − λ 64 + ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 6 ( s + 1 ) − 4 Γ 6 ( s + 1 ) − 5 2 16 Γ 6 ( s + 1 ) − 1 2 ( 6 ( s + 1 ) ) ! 2 ! ( 6 ( s + 1 ) − 4 ) ! · 8 F 8 ( s + 1 ) + 1 6 , ( s + 1 ) + 1 3 , ( s + 1 ) + 1 2 , ( s + 1 ) + 2 3 , ( s + 1 ) + 5 6 , 2 ( s + 1 ) − 5 6 , 2 ( s + 1 ) − 1 2 , 2 ( s + 1 ) − 1 6 4 3 , 5 3 , ( s + 1 ) − 1 12 , ( s + 1 ) + 1 12 , ( s + 1 ) + 1 4 , ( s + 1 ) + 5 12 , ( s + 1 ) + 7 12 , ( s + 1 ) + 3 4 ; − λ 64 G 8 , 0 ( λ ; x ) = ∑ s = 0 ∞ λ s s ! x 8 s 11 F 11 s + 1 8 , s + 1 4 , s + 3 8 , s + 1 2 , s + 5 8 , s + 3 4 , s + 7 8 , 2 s − 1 8 , 2 s + 1 8 , 2 s + 3 8 , 2 s + 5 8 1 4 , 1 2 , 3 4 , s − 1 16 , s + 1 16 , s + 3 16 , s + 5 16 , s + 7 16 , s + 9 16 , s + 11 16 , s + 13 16 ; λ 256 − ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 8 ( s + 1 ) − 2 Γ 8 ( s + 1 ) − 3 2 4 Γ 8 ( s + 1 ) − 1 2 ( 8 ( s + 1 ) ) ! ( 8 ( s + 1 ) − 2 ) ! · 11 F 11 ( s + 1 ) + 1 8 , ( s + 1 ) + 1 4 , ( s + 1 ) + 3 8 , ( s + 1 ) + 1 2 , ( s + 1 ) + 5 8 , ( s + 1 ) + 3 4 , ( s + 1 ) + 7 8 , 2 ( s + 1 ) − 3 8 , 2 ( s + 1 ) − 1 8 , 2 ( s + 1 ) + 1 8 , 2 ( s + 1 ) + 3 8 1 2 , 3 4 , 5 4 , ( s + 1 ) − 1 16 , ( s + 1 ) + 1 16 , ( s + 1 ) + 3 16 , ( s + 1 ) + 5 16 , ( s + 1 ) + 7 16 , ( s + 1 ) + 9 16 , ( s + 1 ) + 11 16 , ( s + 1 ) + 13 16 ; λ 256 + ∑ s = 0 ∞ λ s + 1 ( s + 1 ) ! x 8 ( s + 1 ) − 4 Γ 8 ( s + 1 ) − 5 2 16 Γ 8 ( s + 1 ) − 1 2 ( 8 ( s + 1 ) ) ! 2 ! ( 8 ( s + 1 ) − 4 ) ! · 11 F 11 ( s + 1 ) + 1 8