Skip to main content
SpringerLink
Log in

Tauberian Theorem of Erdős Revisited

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Dedicated to the memory of Paul Erdős

In connection with the elementary proof of the prime number theorem, Erdős obtained a striking quadratic Tauberian theorem for sequences. Somewhat later, Siegel indicated in a letter how a powerful "fundamental relation" could be used to simplify the difficult combinatorial proof. Here the author presents his version of the (unpublished) Erdős–Siegel proof. Related Tauberian results by the author are described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Amsterdam; Plantage Muidergracht 24, 1018 TV, Amsterdam, Netherlands; E-mail: korevaar@science.uva.nl, , , , , , NL

    J. Korevaar

Authors
  1. J. Korevaar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received December 20, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korevaar, J. Tauberian Theorem of Erdős Revisited. Combinatorica 21, 239–250 (2001). https://doi.org/10.1007/s004930100022

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100022

Search

Navigation