scholarly journals A General Family of q-Hypergeometric Polynomials and Associated Generating Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1161
Author(s):  
Hari Mohan Srivastava ◽  
Sama Arjika
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Additional Parameter ◽  
Physical Sciences ◽  
General Family ◽  
Hypergeometric Polynomials

Basic (or q-) series and basic (or q-) polynomials, especially the basic (or q-) hypergeometric functions and the basic (or q-) hypergeometric polynomials are studied extensively and widely due mainly to their potential for applications in many areas of mathematical and physical sciences. Here, in this paper, we introduce a general family of q-hypergeometric polynomials and investigate several q-series identities such as an extended generating function and a Srivastava-Agarwal type bilinear generating function for this family of q-hypergeometric polynomials. We give a transformational identity involving generating functions for the generalized q-hypergeometric polynomials which we have introduced here. We also point out relevant connections of the various q-results, which we investigate here, with those in several related earlier works on this subject. We conclude this paper by remarking that it will be a rather trivial and inconsequential exercise to give the so-called (p,q)-variations of the q-results, which we have investigated here, because the additional parameter p is obviously redundant.

scholarly journals Bilinear generating relations for a family of q-polynomials and generalized basic hypergeometric functions

2012 ◽  
Vol 16 (2) ◽  
pp. 191-199
Author(s):  
S. D. Purohit ◽  
V. K. Vyas ◽  
R. K. Yadav
Keyword(s):  
Generating Function ◽  
General Class ◽  
Hypergeometric Functions ◽  
Hypergeometric Polynomials ◽  
Basic Hypergeometric Functions ◽  
Generating Relations ◽  
Basic Analogue ◽  
Fox’S H Function

In this paper, we derive a bilinear q-generating function involving basic analogue of Fox's H-function and a general class of q-hypergeometric polynomials. Applications of the main results are also illustrated.

scholarly journals Some applications of Srivastava’s theorem involving a certain family of generalized and extended hypergeometric polynomials

Filomat ◽  
2015 ◽  
Vol 29 (8) ◽  
pp. 1811-1819 ◽  
Author(s):  
Shy-Der Lin ◽  
H.M. Srivastava ◽  
Mu-Ming Wong
Keyword(s):  
Generating Functions ◽  
Hypergeometric Functions ◽  
Integral Transforms ◽  
Pochhammer Symbol ◽  
Generalized Hypergeometric Functions ◽  
Fundamental Properties ◽  
Hypergeometric Polynomials ◽  
Special Cases

Recently, Srivastava et al. [H. M. Srivastava, M. A. Chaudhry and R. P. Agarwal, The incomplete Pochhammer symbols and their applications to hypergeometric and related functions, Integral Transforms Spec. Funct. 23 (2012), 659-683] introduced and initiated the study of many interesting fundamental properties and characteristics of a certain pair of potentially useful families of the so-called generalized incomplete hypergeometric functions. Ever since then there have appeared many closely-related works dealing essentially with notable developments involving various classes of generalized hypergeometric functions and generalized hypergeometric polynomials, which are defined by means of the corresponding incomplete and other novel extensions of the familiar Pochhammer symbol. Here, in this sequel to some of these earlier works, we derive several general families of hypergeometric generating functions by applying Srivastava?s Theorem. We also indicate various (known or new) special cases and consequences of the results presented in this paper.

scholarly journals Some New Classes of Generalized Lagrange-Based Apostol Type Hermite Polynomials

2018 ◽  
Author(s):  
Waseem A. Khan ◽  
K.S. Nisar
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Hermite Polynomials ◽  
Euler Polynomials ◽  
General Symmetry ◽  
Basic Properties ◽  
Genocchi Polynomials ◽  
General Family ◽  
Summation Formulae ◽  
Explicit Representations

In this paper, we introduce a general family of Lagrange-based Apostol-type Hermite polynomials thereby unifying the Lagrange-based Apostol Hermite-Bernoulli and the Lagrange-based Apostol Hermite-Genocchi polynomials. We also define Lagrange-based Apostol Hermite-Euler polynomials via the generating function. In terms of these generalizations, we find new and useful relations between the unified family and the Apostol Hermite-Euler polynomials. We also derive their explicit representations and list some basic properties of each of them. Some implicit summation formulae and general symmetry identities are derived by using different analytical means and applying generating functions.

scholarly journals On the birthday problem: some generalizations and applications

2003 ◽  
Vol 2003 (60) ◽  
pp. 3827-3840 ◽  
Author(s):  
P. N. Rathie ◽  
P. Zörnig
Keyword(s):  
Probability Distribution ◽  
Random Graph ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Exact Probability ◽  
Confluent Hypergeometric Functions ◽  
Birthday Problem ◽  
Exact Probability Distribution

We study the birthday problem and some possible extensions. We discuss the unimodality of the corresponding exact probability distribution and express the moments and generating functions by means of confluent hypergeometric functionsU(−;−;−)which are computable using the software Mathematica. The distribution is generalized in two possible directions, one of them consists in considering a random graph with a single attracting center. Possible applications are also indicated.

scholarly journals Bilateral Generating Functions Involving Generalized Hypergeometric Polynomials of Two Variables

2017 ◽  
Vol 10 (12) ◽  
pp. 1-5
Author(s):  
P. L. Rama Kameswari ◽  
P. L. Rama Kameswari ◽  
V. S. Bhagavan ◽  
◽  
◽  
...  
Keyword(s):  
Generating Functions ◽  
Hypergeometric Polynomials ◽  
Bilateral Generating Functions

scholarly journals Generating Functions for Certain Weighted Cranks

2022 ◽  
Vol Volume 44 - Special... ◽  
Author(s):  
Shreejit Bandyopadhyay ◽  
Ae Yee
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Colored Partitions ◽  
Unimodal Sequences

Recently, George Beck posed many interesting partition problems considering the number of ones in partitions. In this paper, we first consider the crank generating function weighted by the number of ones and obtain analytic formulas for this weighted crank function under conditions of the crank being less than or equal to some specific integer. We connect these cumulative and point crank functions to the generating functions of partitions with certain sizes of Durfee rectangles. We then consider a generalization of the crank for $k$-colored partitions, which was first introduced by Fu and Tang, and investigate the corresponding generating function for this crank weighted by the number of parts in the first subpartition of a $k$-colored partition. We show that the cumulative generating functions are the same as the generating functions for certain unimodal sequences.

scholarly journals Labels distance in bucket recursive trees with variable capacities of buckets

2021 ◽  
Vol 13 (2) ◽  
pp. 413-426
Author(s):  
S. Naderi ◽  
R. Kazemi ◽  
M. H. Behzadi
Keyword(s):  
Partial Differential Equations ◽  
Probability Distribution ◽  
Differential Equations ◽  
Generating Function ◽  
Generating Functions ◽  
Function Approach ◽  
Closed Formula ◽  
Tree Model ◽  
Partial Differential ◽  
Recursive Trees

Abstract The bucket recursive tree is a natural multivariate structure. In this paper, we apply a trivariate generating function approach for studying of the depth and distance quantities in this tree model with variable bucket capacities and give a closed formula for the probability distribution, the expectation and the variance. We show as j → ∞, lim-iting distributions are Gaussian. The results are obtained by presenting partial differential equations for moment generating functions and solving them.

COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS

2011 ◽  
Vol 21 (07) ◽  
pp. 1217-1235 ◽  
Author(s):  
VÍCTOR BLANCO ◽  
PEDRO A. GARCÍA-SÁNCHEZ ◽  
JUSTO PUERTO
Keyword(s):  
Generating Function ◽  
Polynomial Time ◽  
Generating Functions ◽  
Time Complexity ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Polynomial Time Complexity ◽  
Theoretical Results

This paper presents a new methodology to compute the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.

A General Asymptotic Scheme for the Analysis of Partition Statistics

2014 ◽  
Vol 23 (6) ◽  
pp. 1057-1086 ◽  
Author(s):  
PETER J. GRABNER ◽  
ARNOLD KNOPFMACHER ◽  
STEPHAN WAGNER
Keyword(s):  
Generating Function ◽  
Asymptotic Expansions ◽  
Generating Functions ◽  
Singularity Analysis ◽  
Higher Moments ◽  
Integer Partitions ◽  
Classical Singularity ◽  
Random Integer ◽  
Partition Statistics ◽  
New Statistics

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.

Polynomial bounds for probability generating functions

1975 ◽  
Vol 12 (3) ◽  
pp. 507-514 ◽  
Author(s):  
Henry Braun
Keyword(s):  
Lower Bound ◽  
Generating Function ◽  
Generating Functions ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Probability Generating Functions ◽  
Extinction Probabilities ◽  
Polynomial Bounds

The problem of approximating an arbitrary probability generating function (p.g.f.) by a polynomial is considered. It is shown that if the coefficients rj are chosen so that LN(·) agrees with g(·) to k derivatives at s = 1 and to (N – k) derivatives at s = 0, then LN is in fact an upper or lower bound to g; the nature of the bound depends only on k and not on N. Application of the results to the problems of finding bounds for extinction probabilities, extinction time distributions and moments of branching process distributions are examined.

Sign in / Sign up

Export Citation Format

Share Document