 |
Discrete Mathematics & Theoretical Computer Science |
Andreas Weiermann - Analytic combinatorics for a certain well-ordered class of iterated exponential terms
dmtcs:3379 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms - https://doi.org/10.46298/dmtcs.3379Analytic combinatorics for a certain well-ordered class of iterated exponential termsConference paper
Authors: Andreas Weiermann 
1
- 1 Mathematical Institute
The aim of this paper is threefold: firstly, to explain a certain segment of ordinals in terms which are familiar to the analytic combinatorics community, secondly to state a great many of associated problems on resulting count functions and thirdly, to provide some weak asymptotic for the resulting count functions. We employ for simplicity Tauberian methods. The analytic combinatorics community is encouraged to provide (maybe in joint work) sharper results in future investigations.
Source: HAL:hal-01184214v1
Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [en] analytic combinatorics, Tauberian theorems orders of infinity, slow varying functions, ordinals
Consultation statistics
This page has been seen 263 times.
This article's PDF has been downloaded 256 times.