Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This textbook offers the opportunity to create a uniquely engaging combinatorics classroom by embracing Inquiry-Based Learning (IBL) techniques. Readers are provided with a carefully chosen progression of theorems to prove and problems to actively solve. Students will feel a sense of accomplishment as their collective inquiry traces a path from the basics to important generating function techniques. Beginning with an exploration of permutations and combinations that culminates in the Binomial Theorem, the text goes on to guide the study of ordinary and exponential generating functions. These tools underpin the in-depth study of Eulerian, Catalan, and Narayana numbers that follows, and a selection of advanced topics that includes applications to probability and number theory. Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research. Inquiry-Based Enumerative Combinatorics is ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites. Because it includes many connections to recent research, students of any level who are interested in combinatorics will also find this a valuable resource.

Combinatorics. --- Combinatorics --- Algebra --- Mathematical analysis --- Combinatorial analysis.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Graph theory. --- Additive combinatorics.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

519.1 --- Combinatorics. Graph theory --- 519.1 Combinatorics. Graph theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial geometry. --- Geometric combinatorics --- Geometrical combinatorics --- Combinatorial analysis --- Discrete geometry

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

combinatorics --- ordered algebraic structures --- enumerative combinatorics --- Combinatorial analysis --- Combinatorial analysis. --- Combinatorics --- Algebra --- Mathematical analysis