[图书][B] Special functions: An introduction to the classical functions of mathematical physics

NM Temme - 2011 - books.google.com
This book gives an introduction to the classical, well-known special functions which play a
role in mathematical physics, especially in boundary value problems. Calculus and complex …

[图书][B] Logarithmic combinatorial structures: a probabilistic approach

R Arratia, AD Barbour, S Tavaré - 2003 - books.google.com
This book explains similarities in asymptotic behavior as the result of two basic properties
shared by the structures: the conditioning relation and the logarithmic condition. The …

Central and local limit theorems applied to asymptotic enumeration

EA Bender - Journal of Combinatorial Theory, Series A, 1973 - Elsevier
Let a double sequence an (k)⩾ 0 be given. We prove a simple theorem on generating
functions which can be used to establish the asymptotic normality of an (k) as a function of k …

[PDF][PDF] Asymptotic enumeration methods

AM Odlyzko - Handbook of combinatorics, 1995 - Citeseer
Asymptotic enumeration methods provide quantitative information about the rate of growth of
functions that count combinatorial objects. Typical questions that these methods answer …

A few seedlings of research

JM Hammersley - Proc. Sixth Berkeley Symp. Math. Statist. and …, 1972 - books.google.com
Graduate students sometimes ask. or fail to ask:" How does one do research in
mathematical statistics? It is a reasonable question because the fruits of research. lectures …

A unified approach to generalized Stirling numbers

LC Hsu, PJS Shiue - Advances in Applied Mathematics, 1998 - Elsevier
It is shown that various well-known generalizations of Stirling numbers of the first and
second kinds can be unified by starting with transformations between generalized factorials …

[图书][B] Combinatorial methods in discrete mathematics

VN Sachkov - 1996 - books.google.com
Discrete mathematics is an important tool for the investigation of various models of
functioning of technical devices, especially in the field of cybernetics. Here the author …

Probabilistic bounds on the coefficients of polynomials with only real zeros

J Pitman - Journal of Combinatorial Theory, Series A, 1997 - Elsevier
The work of Harper and subsequent authors has shown that finite sequences (a0,…, an)
arising from combinatorial problems are often such that the polynomialA (z):=∑ nk …

Asymptotic estimates of Stirling numbers

NM Temme - Studies in Applied Mathematics, 1993 - Wiley Online Library
Asymptotic Estimates of Stirling Numbers Page 1 Asymptotic Estimates of Stirling Numbers By
NM Temme New asymptotic estimates are given of the Stirling numbers s~m) and ®~m), of first …

Some aspects of the random sequence

DE Barton, CL Mallows - The Annals of Mathematical Statistics, 1965 - projecteuclid.org
This is primarily a review of combinatorial problems connected with ballot problems, runs,
records, and amalgamation, but numerous new results and applications occur throughout …