Listing 1 - 6 of 6 |
Sort by
|
Choose an application
"This graduate level textbook covers classical and modern developments in graph theory and additive combinatorics, presenting arguments as a cohesive whole. Students will appreciate the chapter summaries, many figures and exercises, as well as the complementary set of lecture videos freely available through MIT OpenCourseWare"--
Choose an application
Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics. Readers will explore central results in additive combinatorics-notably the cornerstone theorems of Roth, Szemerédi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turán problem, Szemerédi's graph regularity method, pseudorandom graphs, graph limits, graph homomorphism inequalities, Fourier analysis in additive combinatorics, the structure of set addition, and the sum-product problem. Important combinatorial, graph theoretic, analytic, Fourier, algebraic, and geometric methods are highlighted. Students will appreciate the chapter summaries, many figures and exercises, and freely available lecture videos on MIT OpenCourseWare. Meant as an introduction for students and researchers studying combinatorics, theoretical computer science, analysis, probability, and number theory, the text assumes only basic familiarity with abstract algebra, analysis, and linear algebra.
Choose an application
Approximate groups have shot to prominence in recent years, driven both by rapid progress in the field itself and by a varied and expanding range of applications. This text collects, for the first time in book form, the main concepts and techniques into a single, self-contained introduction. The author presents a number of recent developments in the field, including an exposition of his recent result classifying nilpotent approximate groups. The book also features a considerable amount of previously unpublished material, as well as numerous exercises and motivating examples. It closes with a substantial chapter on applications, including an exposition of Breuillard, Green and Tao's celebrated approximate-group proof of Gromov's theorem on groups of polynomial growth. Written by an author who is at the forefront of both researching and teaching this topic, this text will be useful to advanced students and to researchers working in approximate groups and related areas.
Group theory. --- Additive combinatorics. --- Combinatorial number theory. --- Geometric group theory.
Choose an application
Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate-level 2006 text will allow students and researchers easy entry into this fascinating field. Here, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemerédi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.
Additive combinatorics --- Additive combinatorics. --- Combinatorial analysis --- Analyse combinatoire --- Combinatorial analysis. --- Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Topology --- Combinatorics --- Algebra --- Mathematical analysis --- Extremal problems
Choose an application
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.
Additive combinatorics. --- Combinatorial number theory. --- Electronic books. -- local. --- Combinatorial number theory --- Additive combinatorics --- Algebra --- Mathematics --- Physical Sciences & Mathematics --- Mathematics. --- Discrete mathematics. --- Combinatorics. --- Discrete Mathematics. --- Combinatorial analysis --- Number theory --- Combinatorics --- Mathematical analysis --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Choose an application
Nestled between number theory, combinatorics, algebra, and analysis lies a rapidly developing subject in mathematics variously known as additive combinatorics, additive number theory, additive group theory, and combinatorial number theory. Its main objects of study are not abelian groups themselves, but rather the additive structure of subsets and subsequences of an abelian group, i.e. sumsets and subsequence sums. This text is a hybrid of a research monograph and an introductory graduate textbook. With few exceptions, all results presented are self-contained, written in great detail, and only reliant upon material covered in an advanced undergraduate curriculum supplemented with some additional Algebra, rendering this book usable as an entry-level text. However, it will perhaps be of even more interest to researchers already in the field. The majority of material is not found in book form and includes many new results as well. Even classical results, when included, are given in greater generality or using new proof variations. The text has a particular focus on results of a more exact and precise nature, results with strong hypotheses and yet stronger conclusions, and on fundamental aspects of the theory. Also included are intricate results often neglected in other texts owing to their complexity. Highlights include an extensive treatment of Freiman Homomorphisms and the Universal Ambient Group of sumsets A+B, an entire chapter devoted to Hamidoune’s Isoperimetric Method, a novel generalization allowing infinite summands in finite sumset questions, weighted zero-sum problems treated in the general context of viewing homomorphisms as weights, and simplified proofs of the Kemperman Structure Theorem and the Partition Theorem for setpartitions. .
Mathematics. --- Additive combinatorics --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Algebra. --- Ordered algebraic structures. --- Sequences (Mathematics). --- Number theory. --- Number Theory. --- Sequences, Series, Summability. --- Order, Lattices, Ordered Algebraic Structures. --- Isoperimetric inequalities. --- Math --- Science --- Geometry, Plane --- Inequalities (Mathematics) --- Mathematical analysis --- Mathematical sequences --- Numerical sequences --- Number study --- Numbers, Theory of --- Algebraic structures, Ordered --- Structures, Ordered algebraic
Listing 1 - 6 of 6 |
Sort by
|