Analytic combinatorics for a certain well-ordered class of iterated exponential terms - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Analytic combinatorics for a certain well-ordered class of iterated exponential terms

Abstract

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.
Fichier principal
Vignette du fichier
dmAD0139.pdf (110.46 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184214 , version 1 (13-08-2015)

Identifiers

Cite

Andreas Weiermann. Analytic combinatorics for a certain well-ordered class of iterated exponential terms. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.409-416, ⟨10.46298/dmtcs.3379⟩. ⟨hal-01184214⟩

Collections

TDS-MACS
54 View
527 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More