Sequences (book)

Sequences is a mathematical monograph on integer sequences. It was written by Heini Halberstam and Klaus Roth, published in 1966 by the Clarendon Press, and republished in 1983 with minor corrections by Springer-Verlag. Although planned to be part of a two-volume set,[1][2] the second volume was never published.

Topics

The book has five chapters,[1] each largely self-contained[2][3] and loosely organized around different techniques used to solve problems in this area,[2] with an appendix on the background material in number theory needed for reading the book.[1] Rather than being concerned with specific sequences such as the prime numbers or square numbers, its topic is the mathematical theory of sequences in general.[4][5]

The first chapter considers the natural density of sequences, and related concepts such as the Schnirelmann density. It proves theorems on the density of sumsets of sequences, including Mann's theorem that the Schnirelmann density of a sumset is at least the sum of the Schnirelmann densities and Kneser's theorem on the structure of sequences whose lower asymptotic density is subadditive. It studies essential components, sequences that when added to another sequence of Schnirelmann density between zero and one, increase their density, proves that additive bases are essential components, and gives examples of essential components that are not additive bases.[1][4][5][6]

The second chapter concerns the number of representations of the integers as sums of a given number of elements from a given sequence, and includes the Erdős–Fuchs theorem according to which this number of representations cannot be close to a linear function. The third chapter continues the study of numbers of representations, using the probabilistic method; it includes the theorem that there exists an additive basis of order two whose number of representations is logarithmic, later strengthened to all orders in the Erdős–Tetali theorem.[1][4][5][6]

After a chapter on sieve theory and the large sieve (unfortunately missing significant developments that happened soon after the book's publication),[4][5] the final chapter concerns primitive sequences of integers, sequences like the prime numbers in which no element is divisible by another. It includes Behrend's theorem that such a sequence must have logarithmic density zero, and the seemingly-contradictory construction by Abram Samoilovitch Besicovitch of primitive sequences with natural density close to 1/2. It also discusses the sequences that contain all integer multiples of their members, the Davenport–Erdős theorem according to which the lower natural and logarithmic density exist and are equal for such sequences, and a related construction of Besicovitch of a sequence of multiples that has no natural density.[1][4][5]

Audience and reception

This book is aimed at other mathematicians and students of mathematics; it is not suitable for a general audience.[2] However, reviewer J. W. S. Cassels suggests that it could be accessible to advanced undergraduates in mathematics.[4]

Reviewer E. M. Wright notes the book's "accurate scholarship", "most readable exposition", and "fascinating topics".[3] Reviewer Marvin Knopp describes the book as "masterly", and as the first book to overview additive combinatorics.[2] Similarly, although Cassels notes the existence of material on additive combinatorics in the books Additive Zahlentheorie (Ostmann, 1956) and Addition Theorems (Mann, 1965), he calls this "the first connected account" of the area,[4] and reviewer Harold Stark notes that much of material covered by the book is "unique in book form".[5] Knopp also praises the book for, in many cases, correcting errors or deficiencies in the original sources that it surveys.[2] Reviewer Harold Stark writes that the book "should be a standard reference in this area for years to come".[5]

gollark: https://knightos.org/, not that this "counts", being a weird OS for certain graphing calculators?
gollark: DOS?
gollark: Microcontroller-type devices will do way better.
gollark: Are you sure it's not using some sort of feature where it stealthily un-hibernates?
gollark: The pi spends a few seconds just self-indulgently displaying its RGB pattern thing.

References
  1. Kubilius, J., "Review of Sequences", Mathematical Reviews, MR 0210679
  2. Knopp, Marvin I. (January 1967), "Questions and methods in number theory", Science, 155 (3761): 442–443, Bibcode:1967Sci...155..442H, JSTOR 1720189
  3. Wright, E. M. (1968), "Review of Sequences", Journal of the London Mathematical Society, s1-43 (1): 157, doi:10.1112/jlms/s1-43.1.157a
  4. Cassels, J. W. S. (February 1968), "Review of Sequences", The Mathematical Gazette, 52 (379): 85–86, doi:10.2307/3614509, JSTOR 3614509
  5. Stark, H. M. (1971), "Review of Sequences", Bulletin of the American Mathematical Society, 77 (6): 943–957, doi:10.1090/s0002-9904-1971-12812-4
  6. Briggs, W. E., "Review of Sequences", zbMATH, Zbl 0141.04405
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.