Combinatorial number theory and additive group theory
Our rough guess is there are 82,500 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 30 minutes to read. With a half hour per day, this will take 11 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Ruzsa, Imre - Contributor
Publication
2009 - Birkhäuser, Basel, Switzerland
Language
English
Word Count
82,500 words, Guess
Page Count
330 pages
Identifiers
- Internet Archivecombinatorialnum00gero_834
- Internet Archivecombinatorialnum00gero_391
- Internet Archivecombinatorialnum00gero
- Internet Archivecombinatorialnum00gero_519
- Internet Archivecombinatorialnum00gero_991
and 9 more
- ISBN-103764389613
- ISBN-103764389621
- ISBN-139783764389611
- ISBN-139783764389628
- Library of Congress Control Number2008941509
- OCLC Control Number269435387
- Better World Books9783764389611
- Better World Books9783764389628
- Open LibraryOL25175824M
Classifications
- DDC511.6
- LCCQA164 .G47 2009
- LCCQA150-272QA164-167.2
and 1 more
- LCCQA297.4
Description
This book collects the material delivered in the 2008 edition of the DocCourse in Combinatorics and Geometry which was devoted to the topic of additive combinatorics. The first two parts, which form the bulk of the volume, contain the two main advanced courses, Additive Group Theory and Non-Unique Factorizations by Alfred Geroldinger, and Sumsets and Structure by Imre Z. Ruzsa. The first part centers on the interaction between non-unique factorization theory and additive group theory. The main objective of factorization theory is a systematic treatment of phenomena related to the non-uniqueness of factorizations in monoids and domains. This part introduces basic concepts of factorization theory such as sets of lengths, and outlines the translation of arithmetical questions in Krull monoids into combinatorial questions on zero-sum sequences over the class group. Using methods from additive group theory such as the theorems of Kneser and of Kemperman-Scherk, classical zero-sum constants are studied, including the Davenport constant and the Erdös-Ginzburg-Ziv constant. Finally these results are applied again to the starting arithmetical problems. The second part is a course on the basics of combinatorial number theory (or additive combinatorics): cardinality inequalities (Plünnecke’s graph theoretical method), Freiman’s theorem on the structure of sets with a small sumset, inequalities for the Schnirelmann and asymptotic density of sumsets, analogous results for the measure of sumsets of reals, the connection with the Bohr topology. The third part of the volume collects some of the seminars which accompanied the main courses. It contains contributions by C. Elsholtz, G. Freiman, Y. O. Hamidoune, N. Hegyvari, G. Karolyi, M. Nathanson, J. Solymosi and Y. Stanchescu.
Subjects
Topics
Places
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!