1975
DOI: 10.1090/s0002-9947-1975-0369770-5
|View full text |Cite
|
Sign up to set email alerts
|

Some polynomials defined by generating relations

Abstract: ABSTRACT. In an attempt to present a unified treatment of the various polynomial systems introduced from time to time, new generating functions are given for the sets of polynomials {S" ¿ (A.; x)} and {7"¿ ^ '(\; x)}, defined respectively by (6) and (29)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
9
0

Year Published

1977
1977
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…Let the parameters a, ß and Xx.Xr, and the coefficients C(kx,..., kr), kj; > 0, V/' G {1,..., r}, be arbitrary complex numbers independent of n. Also let the sequence of polynomials AÍa,/3)[A1 (... ,Xr; qx,... ,qr;zx.z,] be defined by equation (40) Remark. Evidently, in the general case considered in [1], the above equations (41*) and (42*) would replace our earlier relationships (41) and (42), respectively.…”
mentioning
confidence: 74%
See 2 more Smart Citations
“…Let the parameters a, ß and Xx.Xr, and the coefficients C(kx,..., kr), kj; > 0, V/' G {1,..., r}, be arbitrary complex numbers independent of n. Also let the sequence of polynomials AÍa,/3)[A1 (... ,Xr; qx,... ,qr;zx.z,] be defined by equation (40) Remark. Evidently, in the general case considered in [1], the above equations (41*) and (42*) would replace our earlier relationships (41) and (42), respectively.…”
mentioning
confidence: 74%
“…Certain constraints are explicitly specified for the validity of a recent result involving a multivariate generating function, due to the present authors [1, p. 369, Theorem 6]. It is also indicated how this result can be further generalized.…”
mentioning
confidence: 92%
See 1 more Smart Citation
“…The existing literature on generating functions is abundant in results that are based essentially upon the Lagrange expansion theorem as well as the three formulas (15), (16) and (18) (see, for details, [42,Chapter 7]; see also [10], [2], [32], [33], [34], [36], [43], [46] and [54], and as well as many references to other closely-related investigations cited in each of these works). With a view to applying it to derive generating functions for a certain class of generalized incomplete hypergeometric polynomials, we recall here a general result on generating functions asserted by Lemma …”
Section: Generating Functions Based Upon the Lagrange Expansion Theormentioning
confidence: 99%
“…. A corresponding generating function is given by [31] ∞ n=0 α α + (β + 1)n (3.12) where ξ is defined by (2.20) and…”
Section: Srivastava Polynomialsmentioning
confidence: 99%