國立虎尾科技大學 |

Graph theory and additive combinatorics : = exploring structure and randomness /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph theory and additive combinatorics :/ Yufei Zhao.
其他題名:	exploring structure and randomness /
作者:	Zhao, Yufei,
面頁冊數:	1 online resource (xvii, 316 pages) :digital, PDF file(s). :
附註:	Title from publisher's bibliographic system (viewed on 10 Aug 2023).
標題:	Additive combinatorics. -
電子資源:	https://doi.org/10.1017/9781009310956
ISBN:	9781009310956 (ebook)

Graph theory and additive combinatorics : = exploring structure and randomness /
Zhao, Yufei,1988-

Graph theory and additive combinatorics :exploring structure and randomness /Yufei Zhao. - 1 online resource (xvii, 316 pages) :digital, PDF file(s).

Title from publisher's bibliographic system (viewed on 10 Aug 2023).

Appetizer : triangles and equations -- Forbidding a subgraph -- Graph regularity method -- Pseudorandom graphs -- Graph limits -- Graph homomorphism inequalities -- Forbidding 3-term arithmetic progressions -- Structure of set addition -- Sum-product problem -- Progressions in sparse pseudorandom sets.

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, Szemerédi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turán problem, Szemeré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.

ISBN: 9781009310956 (ebook)Subjects--Topical Terms:

1076684
Additive combinatorics.

LC Class. No.: QA166 / .Z54 2023

Dewey Class. No.: 511/.5

Graph theory and additive combinatorics : = exploring structure and randomness /
LDR:02476nam a2200289 i 4500 001 1125313
003 UkCbUP
005 20230816111704.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2023||||enk o ||1 0|eng|d
020 $a 9781009310956 (ebook)
020 $z 9781009310949 (hardback)
035 $a CR9781009310956
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA166 $b .Z54 2023
082 0 0 $a 511/.5 $2 23/eng/20230605
100 1 $a Zhao, Yufei, $d 1988- $e author. $3 1443455
245 1 0 $a Graph theory and additive combinatorics : $b exploring structure and randomness / $c Yufei Zhao.
264 1 $a Cambridge ; New York, NY : $b Cambridge University Press, $c 2023.
300 $a 1 online resource (xvii, 316 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Title from publisher's bibliographic system (viewed on 10 Aug 2023).
505 0 $a Appetizer : triangles and equations -- Forbidding a subgraph -- Graph regularity method -- Pseudorandom graphs -- Graph limits -- Graph homomorphism inequalities -- Forbidding 3-term arithmetic progressions -- Structure of set addition -- Sum-product problem -- Progressions in sparse pseudorandom sets.
520 $a 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, Szemerédi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turán problem, Szemeré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.
650 0 $a Additive combinatorics. $3 1076684
650 0 $a Graph theory. $3 527884
776 0 8 $i Print version: $z 9781009310949
856 4 0 $u https://doi.org/10.1017/9781009310956