Analytic combinatorics for a certain well-ordered class of iterated exponential terms
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2005_special_249_a27,
     author = {Weiermann, Andreas},
     title = {Analytic combinatorics for a certain well-ordered class of iterated exponential terms},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
     year = {2005},
     doi = {10.46298/dmtcs.3379},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3379/}
}
TY  - JOUR
AU  - Weiermann, Andreas
TI  - Analytic combinatorics for a certain well-ordered class of iterated exponential terms
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3379/
DO  - 10.46298/dmtcs.3379
LA  - en
ID  - DMTCS_2005_special_249_a27
ER  - 
%0 Journal Article
%A Weiermann, Andreas
%T Analytic combinatorics for a certain well-ordered class of iterated exponential terms
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3379/
%R 10.46298/dmtcs.3379
%G en
%F DMTCS_2005_special_249_a27
Weiermann, Andreas. Analytic combinatorics for a certain well-ordered class of iterated exponential terms. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005). doi : 10.46298/dmtcs.3379. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3379/

Cité par Sources :