9780387946559-0387946551-Additive Number Theory: Inverse Problems and the Geometry of Sumsets (Graduate Texts in Mathematics, 165)

Additive Number Theory: Inverse Problems and the Geometry of Sumsets (Graduate Texts in Mathematics, 165)

ISBN-13: 9780387946559
ISBN-10: 0387946551
Edition: 1996
Author: Melvyn B. Nathanson
Publication date: 1996
Publisher: Springer
Format: Hardcover 309 pages
FREE US shipping
Buy

From $92.38

Book details

ISBN-13: 9780387946559
ISBN-10: 0387946551
Edition: 1996
Author: Melvyn B. Nathanson
Publication date: 1996
Publisher: Springer
Format: Hardcover 309 pages

Summary

Additive Number Theory: Inverse Problems and the Geometry of Sumsets (Graduate Texts in Mathematics, 165) (ISBN-13: 9780387946559 and ISBN-10: 0387946551), written by authors Melvyn B. Nathanson, was published by Springer in 1996. With an overall rating of 3.5 stars, it's a notable title among other Geometry & Topology (Mathematics) books. You can easily purchase or rent Additive Number Theory: Inverse Problems and the Geometry of Sumsets (Graduate Texts in Mathematics, 165) (Hardcover) from BooksRun, along with many other new and used Geometry & Topology books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

Description

Many classical problems in additive number theory are direct problems, in which one starts with a set A of natural numbers and an integer H -> 2, and tries to describe the structure of the sumset hA consisting of all sums of h elements of A. By contrast, in an inverse problem, one starts with a sumset hA, and attempts to describe the structure of the underlying set A. In recent years there has been ramrkable progress in the study of inverse problems for finite sets of integers. In particular, there are important and beautiful inverse theorems due to Freiman, Kneser, Plünnecke, Vosper, and others. This volume includes their results, and culminates with an elegant proof by Ruzsa of the deep theorem of Freiman that a finite set of integers with a small sumset must be a large subset of an n-dimensional arithmetic progression.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book