ASYMPTOTIC METHODS IN ENUMERATION

被引：326
作者：
BENDER, EA
机构：
[1] UNIV CALIF, SAN DIEGO, DEPT MATH, LA JOLLA, CA 92037 USA
[2] INST DEF ANAL, PRINCETON, NJ 08540 USA
来源：
SIAM REVIEW | 1974年 / 16卷 / 04期
关键词：
D O I：
10.1137/1016082
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This is an expository paper, aimed at the combinatorialist, and dealing with those tools in asymptotic analysis which are especially useful in obtaining asymptotic results in enumeration problems. Emphasis is on tools which are general, are easily applied, and give estimates of the form a//n is approximately f(n). Many examples are given to illustrate the usage of the various tools. It is assumed that a summation or a generating function for a//n is explicitly or implicitly given.
引用
收藏
页码：485 / 515
页数：31
相关论文
共 63 条
[1]  
[Anonymous], 1931, Q J MATH, DOI 10.1093/qmath/os-2.1.177
[2]  
[Anonymous], 1958, ASYMPTOTIC METHODS A
[3]  
AULUCK FC, 1952, P CAMB PHILOS SOC, V48, P566
[4]  
BENDER E, 1974, DISCRETE MATH, V8, P219
[5]  
Bender E.A., 1972, J COMBIN THEORY A, V13, P40, DOI 10.1016/0097-3165(72)90007-6
[6]   ENUMERATIVE USES OF GENERATING FUNCTIONS [J].
BENDER, EA ;
GOLDMAN, JR .
INDIANA UNIVERSITY MATHEMATICS JOURNAL, 1971, 20 (08) :753-&
[7]  
BENDER EA, TO BE PUBLISHED
[8]  
Bender EA, 1973, J COMB THEORY A, V15, P91, DOI DOI 10.1016/0097-3165(73)90038-1
[9]   Formal theory of irregular linear difference equations [J].
Birkhoff, GD .
ACTA MATHEMATICA, 1930, 54 (01) :205-246
[10]  
BLUM J, PREPRINT
1234567