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

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...

Full description

Bibliographic Details
Main Author: Andreas Weiermann
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2005-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/3379/pdf
_version_ 1827324175835987968
author Andreas Weiermann
author_facet Andreas Weiermann
author_sort Andreas Weiermann
collection DOAJ
description 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.
first_indexed 2024-04-25T02:07:52Z
format Article
id doaj.art-f983f3ce048e46a6b91a2edb82e7160e
institution Directory Open Access Journal
issn 1365-8050
language English
last_indexed 2024-04-25T02:07:52Z
publishDate 2005-01-01
publisher Discrete Mathematics & Theoretical Computer Science
record_format Article
series Discrete Mathematics & Theoretical Computer Science
spelling doaj.art-f983f3ce048e46a6b91a2edb82e7160e2024-03-07T14:30:52ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502005-01-01DMTCS Proceedings vol. AD,...Proceedings10.46298/dmtcs.33793379Analytic combinatorics for a certain well-ordered class of iterated exponential termsAndreas Weiermann0https://orcid.org/0000-0002-5561-5323Mathematical InstituteThe 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.https://dmtcs.episciences.org/3379/pdfanalytic combinatoricstauberian theorems orders of infinityslow varying functionsordinals[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]
spellingShingle Andreas Weiermann
Analytic combinatorics for a certain well-ordered class of iterated exponential terms
Discrete Mathematics & Theoretical Computer Science
analytic combinatorics
tauberian theorems orders of infinity
slow varying functions
ordinals
[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]
title Analytic combinatorics for a certain well-ordered class of iterated exponential terms
title_full Analytic combinatorics for a certain well-ordered class of iterated exponential terms
title_fullStr Analytic combinatorics for a certain well-ordered class of iterated exponential terms
title_full_unstemmed Analytic combinatorics for a certain well-ordered class of iterated exponential terms
title_short Analytic combinatorics for a certain well-ordered class of iterated exponential terms
title_sort analytic combinatorics for a certain well ordered class of iterated exponential terms
topic analytic combinatorics
tauberian theorems orders of infinity
slow varying functions
ordinals
[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]
url https://dmtcs.episciences.org/3379/pdf
work_keys_str_mv AT andreasweiermann analyticcombinatoricsforacertainwellorderedclassofiteratedexponentialterms