Dekorationsartikel gehören nicht zum Leistungsumfang.
Graph Theory and Additive Combinatorics
Exploring Structure and Randomness
Buch von Yufei Zhao
Sprache: Englisch

76,15 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
"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"--
"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"--
Über den Autor
Yufei Zhao is Associate Professor of Mathematics at the Massachusetts Institute of Technology. His research tackles a broad range of problems in discrete mathematics, including extremal, probabilistic, and additive combinatorics, graph theory, and discrete geometry, as well as applications to computer science. His honors include the SIAM Dénes K¿nig prize (2018), the Sloan Research Fellowship (2019), and the NSF CAREER Award (2021). This book is based on an MIT graduate course, which he has taught and developed over the last five years.
Inhaltsverzeichnis
Preface; Notation and Conventions; Appetizer: triangles and equations; 1. Forbidding a subgraph; 2. Graph regularity method; 3. Pseudorandom graphs; 4. Graph limits; 5. Graph homomorphism inequalities; 6. Forbidding 3-term arithmetic progressions; 7. Structure of set addition; 8. Sum-product problem; 9. Progressions in sparse pseudorandom sets; References; Index.
Details
Erscheinungsjahr: 2023
Fachbereich: Arithmetik & Algebra
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 338
Inhalt: Gebunden
ISBN-13: 9781009310949
ISBN-10: 1009310941
Sprache: Englisch
Einband: Gebunden
Autor: Zhao, Yufei
Hersteller: Cambridge University Press
Maße: 254 x 183 x 23 mm
Von/Mit: Yufei Zhao
Erscheinungsdatum: 31.08.2023
Gewicht: 0,768 kg
preigu-id: 126453361
Über den Autor
Yufei Zhao is Associate Professor of Mathematics at the Massachusetts Institute of Technology. His research tackles a broad range of problems in discrete mathematics, including extremal, probabilistic, and additive combinatorics, graph theory, and discrete geometry, as well as applications to computer science. His honors include the SIAM Dénes K¿nig prize (2018), the Sloan Research Fellowship (2019), and the NSF CAREER Award (2021). This book is based on an MIT graduate course, which he has taught and developed over the last five years.
Inhaltsverzeichnis
Preface; Notation and Conventions; Appetizer: triangles and equations; 1. Forbidding a subgraph; 2. Graph regularity method; 3. Pseudorandom graphs; 4. Graph limits; 5. Graph homomorphism inequalities; 6. Forbidding 3-term arithmetic progressions; 7. Structure of set addition; 8. Sum-product problem; 9. Progressions in sparse pseudorandom sets; References; Index.
Details
Erscheinungsjahr: 2023
Fachbereich: Arithmetik & Algebra
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 338
Inhalt: Gebunden
ISBN-13: 9781009310949
ISBN-10: 1009310941
Sprache: Englisch
Einband: Gebunden
Autor: Zhao, Yufei
Hersteller: Cambridge University Press
Maße: 254 x 183 x 23 mm
Von/Mit: Yufei Zhao
Erscheinungsdatum: 31.08.2023
Gewicht: 0,768 kg
preigu-id: 126453361
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte