New class of generating functions associated with generalized hypergeometric polynomials

In this paper authors prove a general theorem on generating relations for a certain sequence of functions. Many formulas involving the families of generating functions for generalized hypergeometric polynomials are shown here to be special cases of a general class of generating functions involving generalized hypergeometric polynomials and multiple hypergeometric series of several variables. It is then shown how the main result can be applied to derive a large number of generating functions involving hypergeometric functions of Kampé de Fériet, Srivastava, Srivastava-Daoust, Chaundy, Fasenmyer, Cohen, Pasternack, Khandekar, Rainville and other multiple Gaussian hypergeometric polynomials scattered in the literature of special functions.     

Vertices of given degree in series‐parallel graphs

We show that the numbers of vertices of a given degree k ≥ 1 in several kinds of series‐parallel labeled graphs of size n satisfy a central limit theorem with mean and variance proportional to n, and quadratic exponential tail estimates. We further prove a corresponding theorem for the number of nodes of degree two in labeled planar graphs. The proof method is based on generating functions and singularity analysis. In particular, we need systems of equations for multivariate generating functions and transfer results for singular representations of analytic functions. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

New generating functions for Jacobi and related polynomials

In this paper the authors prove a generalization of certain generating functions for Jacobi and related polynomials, given recently by H. M. Srivastava. The method used is due to Pólya and Szegö, and it is based on Rodrigues' formula for the Jacobi polynomials and Lagrange's expansion theorem. A number of special and limiting cases of the main result will give rise to a class of generating functions for ultraspherical, Laguerre and Bessel polynomials.     

The algebra of set functions II: An enumerative analogue of Hall’s theorem for bipartite graphs

Triesch (1997) [25] conjectured that Hall’s classical theorem on matchings in bipartite graphs is a special case of a phenomenon of monotonicity for the number of matchings in such graphs. We prove this conjecture for all graphs with sufficiently many edges by deriving an explicit monotonic formula counting matchings in bipartite graphs.This formula follows from a general duality theory which we develop for counting matchings. Moreover, we make use of generating functions for set functions as introduced by Lass [20], and we show how they are useful for counting matchings in bipartite graphs in many different ways.     

An extension of bilateral generating functions of modified Laguerre polynomials

In this note a theorem concerning the extension of bilateral generating functions of the modified Laguerre polynomials is derived. Some applications of the theorem are also pointed out.     

A Logarithmic Connection for Circular Permutation Enumeration

A general theorem is obtained for the enumeration of permutations equivalent under cyclic rotation. This result gives the generating function as the logarithm of a determinant which arises in the enumeration of a related linear permutation enumeration. Applications of this theorem are given to a number of classical enumerative problems.     

Asymptotic enumeration by Khintchine–Meinardus probabilistic method: necessary and sufficient conditions for sub-exponential growth

In this paper, we prove the necessity of the main sufficient condition of Meinardus for sub-exponential rate of growth of the number of structures, having multiplicative generating functions of a general form and establish a new necessary and sufficient condition for normal local limit theorem for aforementioned structures. The latter result allows to encompass in our study structures with sequences of weights having gaps in their support.     

Numerical studies of time-independent and time-dependent scattering by several elliptical cylinders

A numerical solution to the problem of time-dependent scattering by an array of elliptical cylinders with parallel axes is presented. The solution is an exact one, based on the separation-of-variables technique in the elliptical coordinate system, the addition theorem for Mathieu functions, and numerical integration. Time-independent solutions are described by a system of linear equations of infinite order which are truncated for numerical computations. Time-dependent solutions are obtained by numerical integration involving a large number of these solutions. First results of a software package generating these solutions are presented: wave propagation around three impenetrable elliptical scatterers. As far as we know, this method described has never been used for time-dependent multiple scattering.     

Restricted words by adjacencies

A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to refinements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation on compositions, (2) the enumeration of directed vertically convex polyominoes by upper descents, area, perimeter, relative height, and column number, (3) a tri-variate extension of MacMahon's determinant formula for permutations with prescribed descent set, and (4) a combinatorial setting for an entire sequence of bibasic Bessel functions.     

Numerical analysis for bulk-arrival queueing systems: Root-finding and steady-state probabilities inGI r /M/1 queues

Queueing theorists have presented, as solutions to many queueing models, probability generating functions in which state probabilities are expressed as functions of the roots of characteristic equations, evaluation of the roots in particular cases being left to the reader. Many users have complained that such solutions are inadequate. Some queueing theorists, in particular Neuts [6], rather than use Rouché's theorem to count roots and an equation-solver to find them, have developed new algorithms to solve queueing problems numerically, without explicit calculation of roots. Powell [7] has shown that in many bulk service queues arising in transportation models, characteristic equations can be solved and state probabilities can be found without serious difficulty, even when the number of roots to be found is large. We have slightly modified Powell's method, and have extended his work to cover a number of bulk-service queues discussed by Chaudhry et al. [1] and a number of bulk-arrival queues discussed in the present paper.     

Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures

A Local limit theorem for the distribution of the number of components in random labelled relational structures of size n (e.g., a type of random graphs on n vertices, random permutations of n elements, etc.) is proved as n→∞. The case when the corresponding exponential generating functions diverge at their radii of convergence is considered.     

A CLT for a band matrix model

A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of the same variance. The derivation is based on systematic combinatorial enumeration, study of generating functions, and concentration inequalities of the Poincaré type. Special cases treated, with an explicit evaluation of limiting variances, are generalized Wigner and Wishart matrices. O.Z. was partially supported by NSF grant number DMS-0302230.     

On Minimal-Moment Generating Functions

A formula expressing the inverse cumulative distribution function of a non-negative random variable in terms of contour integrals of its minimal-moment generating function is proved as well as an analog of the classical continuity theorem for characteristic functions.     

局部积分余弦算子函数的生成定理

本文讨论局部k次积分Cosine算子函数，在不假定其生成元稠定每件下，建立一个Hille—yosida型定理．     

Quasi-analytical root-finding for non-polynomial functions

A method is presented for the calculation of roots of non-polynomial functions, motivated by the requirement to generate quadrature rules based on non-polynomial orthogonal functions. The approach uses a combination of local Taylor expansions and Sturm’s theorem for roots of a polynomial which together give a means of efficiently generating estimates of zeros which can be polished using Newton’s method. The technique is tested on a number of realistic problems including some chosen to be highly oscillatory and to have large variations in amplitude, both of which features pose particular challenges to root–finding methods.     

Vectorial variational principle with variable set-valued perturbation

We give a general vectorial Ekeland's variational principle, where the objective function is defined on an F-type topological space and taking values in a pre-ordered real linear space. Being quite different from the previous versions of vectorial Ekeland's variational principle, the perturbation in our version is no longer only dependent on a fixed positive vector or a fixed family of positive vectors. It contains a family of set-valued functions taking values in the positive cone and a family of subadditive functions of topology generating quasi-metrics. Hence, the direction of the perturbation in the new version is a family of variable subsets which are dependent on the ob jective function values. The general version includes and improves a number of known versions of vectorial Ekeland's variational principle. From the general Ekeland's principle, we deduce the corresponding versions of Caristi–Kirk's fixed point theorem and Takahashi's nonconvex minimization theorem. Finally, we prove that all the three theorems are equivalent to each other.     

The algebra of set functions I: The product theorem and duality

We give a comprehensive introduction to the algebra of set functions and its generating functions. This algebraic tool allows us to formulate and prove a product theorem for the enumeration of functions of many different kinds, in particular injective functions, surjective functions, matchings and colourings of the vertices of a hypergraph. Moreover, we develop a general duality theory for counting functions.     

A symmetrical plane partition correspondence

MacMahon conjectured the form of the generating function for symmetrical plane partitions, and as a special case deduced the following theorem. The set of partitions of a number n whose part magnitude and number of parts are both no greater than m is equinumerous with the set of symmetrical plane partitions of 2n whose part magnitude does not exceed 2 and whose largest axis does not exceed m. This theorem, together with a companion theorem for the symmetrical plane partitions of odd numbers, are proved by establishing 1-1 correspondences between the sets of partitions.     

Gauss-Lucas theorems for entire functions on CM

A Gauss-Lucas theorem is proved for multivariate entire functions, using a natural notion of separate convexity to obtain sharp results. Previous work in this area is mostly restricted to univariate entire functions (of genus no greater than one unless “realness” assumptions are made). The present work applies to multivariate entire functions whose sections can be written as a monomial times a canonical product of arbitrary genus. A connection is made with the Levy-Steinitz theorem for conditionally convergent vector series, a result generalizing Riemann’s well-known theorem for conditionally convergent real number series.