Graph Theory and Additive Combinatorics: Exploring Structure and Randomness by Y

Description: FREE SHIPPING UK WIDE Graph Theory and Additive Combinatorics by Yufei Zhao 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. FORMAT Hardcover CONDITION Brand New Publisher Description 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édis 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. Author Biography 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 Knig 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. Table of Contents 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. Review Yufei Zhao does great mathematics and has an uncanny ability to explain the deepest results with clear understandable prose. For anyone interested in the seminal ideas (and their interrelationships) of recent decades - pseudorandomness, graphons, graph regularity, to name a few - this is the book to read and savor. Joel Spencer, New York UniversityThis impeccable book should quickly become a classic text in discrete maths. A huge selection of topics is treated elegantly, with beautiful illustrations, and in just the `right amount of detail to arouse the interest of the reader and leave them well placed to find out more. In particular, the second half of the book is a superb introduction to additive combinatorics, which I will happily recommend to any student in this area. Ben Green, Oxford UniversityThis charming text gives an accessible introduction to the connected topics of extremal graph theory and modern additive combinatorics. The focus is very strongly on presenting intuition and restricting attention to the simplest possible instances of methods or classes of results, rather than aiming for maximal generality or the strongest statements; instead, references are given for further reading, or for the proofs of important theorems that are only stated here. Being highly suitable for advanced undergraduates or beginning graduate students, it fills a niche that is currently not occupied by other texts in these highly active areas of current mathematical research. Terry Tao, University of California, Los AngelesA valuable and readable unified treatment of a fast-moving area of combinatorics from one of the worlds experts - sure to become a standard resource. Jordan Ellenberg, University of Wisconsin-MadisonYufei Zhaos book is a wonderful book about graph theory, additive combinatorics, and their surprising connections, involving a major theme of modern mathematics: the interplay between structure and randomness. In both areas, the book can take the curious reader, whether an advanced undergraduate or a professional mathematician, on a joyous journey from the very basics to state-of-the-art research. Yufei Zhao himself is a major player in modern research in both these areas and his presentation is a tour de force. Gil Kalai, Hebrew University of Jerusalem and Reichman UniversityThis is a beautiful treatment of extremal graph theory and additive combinatorics, focusing on the fruitful interplay between the two. The book covers the classical results as well as recent developments in this active area. It is a fascinating manuscript that would appeal to students and researchers with an interest in discrete mathematics, theoretical computer number theory, and related areas. Noga Alon, Princeton UniversityThis is a wonderful, well-written account of additive combinatorics from the graph theoretic perspective. Zhao skillfully ties in this approach to the usual statements and gives a thorough development of the subject. This book is indispensable for any serious researcher in this area. Beginners will find a thorough account of the subject with plenty of motivation. The more experienced reader will appreciate the authors insights and elegant development of some difficult ideas. Andrew Granville, University of Montréal Promotional An introductory text covering classical and modern developments in graph theory and additive combinatorics, based on Zhaos MIT course. Details ISBN1009310941 Author Yufei Zhao Pages 338 Publisher Cambridge University Press Year 2023 ISBN-10 1009310941 ISBN-13 9781009310949 Format Hardcover Imprint Cambridge University Press Subtitle Exploring Structure and Randomness Place of Publication Cambridge Country of Publication United Kingdom Illustrations Worked examples or Exercises AU Release Date 2023-05-31 NZ Release Date 2023-05-31 Alternative 9781009310956 DEWEY 511.5 Audience Professional & Vocational Publication Date 2023-08-31 UK Release Date 2023-08-31 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! 30 DAY RETURN POLICY No questions asked, 30 day returns! FREE DELIVERY No matter where you are in the UK, delivery is free. SECURE PAYMENT Peace of mind by paying through PayPal and eBay Buyer Protection TheNile_Item_ID:143100575;

Price: 80.18 GBP

Location: London

End Time: 2024-11-23T03:09:43.000Z

Shipping Cost: 8.53 GBP