# Báo cáo toán học: "Asymptotics of Some Convolutional Recurrences"

## Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài:Asymptotics of Some Convolutional Recurrences. | Asymptotics of Some Convolutional Recurrences Edward A. Bender Adri B. Olde Daalhuis Department of Mathematics Maxwell Institute and School of Mathematics University of California San Diego The University of Edinburgh La Jolla CA 92093-0112 Edinburgh Eh9 3JZ UK ebender@ Zhicheng Gao t School of Mathematics and Statistics Carleton University Ottawa Ontario K1S5B6 zgao@ L. Bruce Richmond and Nicholas Wormald Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario N2L3G1 lbrichmond@ nwormald@ Submitted Apr 7 2009 Accepted Dec 14 2009 Published Jan 5 2010 Abstract We study the asymptotic behavior of the terms in sequences satisfying recurrences of the form an an-1 Efc d f n k akan-k where very roughly speaking f n k behaves like a product of reciprocals of binomial coefficients. Some examples of such sequences from map enumerations Airy constants and Painleve I equations are discussed in detail. 1 Main results There are many examples in the literature of sequences defined recursively using a convolution. It often seems difficult to determine the asymptotic behavior of such sequences. In this note we study the asymptotics of a general class of such sequences. We prove Research supported by NSERC 1 Research supported by NSERC Research supported by NSERC and Canada Research Chair Program THE ELECTRONIC JOURNAL OF COMBINATORICS 17 2010 R1 1 subexponential growth by using an iterative method that may be useful for other recurrences. By subexponential growth we mean that for every constant D 1 an o Dn as n TO. Thus our motivation for this note is both the method and the applications we give. Let d 0 be a fixed integer and let f n k 0 be a function that behaves like a product of some powers of reciprocals of binomial coefficients in a general sense to be specified in Theorem 1. We deal with the sequence an for n d where ad ad 1 a2d 1 0 are arbitrary and when n 2d n d an an 1 f

TÀI LIỆU LIÊN QUAN
32    85    0
45    80    0
6    107    0
4    73    0
6    90    0
6    94    0
6    80    0
5    83    0
7    99    0
6    104    0
TÀI LIỆU XEM NHIỀU
13    41262    2427
3    25214    250
25    24895    4301
16    20365    2847
20    19765    1551
14    19675    2978
1    19586    622
3    16441    331
37    16438    2960
1    15046    136
TỪ KHÓA LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
7    319    5    20-07-2024
8    79    2    20-07-2024
5    78    1    20-07-2024
4    187    1    20-07-2024
96    315    4    20-07-2024
4    87    1    20-07-2024
124    182    10    20-07-2024
101    308    4    20-07-2024
5    389    3    20-07-2024
14    347    1    20-07-2024
13    308    1    20-07-2024
5    91    1    20-07-2024
4    281    3    20-07-2024
11    59    1    20-07-2024
18    428    2    20-07-2024
6    727    1    20-07-2024
102    96    3    20-07-2024
96    91    3    20-07-2024
28    181    1    20-07-2024
14    88    1    20-07-2024
TÀI LIỆU HOT
3    25214    250
13    41262    2427
3    3024    81
580    5352    364
584    3582    101
62    6936    1
171    5946    721
2    3405    78
51    4703    200
53    5007    189
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.