Combinatorial algorithms | Additive combinatorics | Mathematical theorems

Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are inverse problems: given the size of the sumset A + B is small, what can we say about the structures of and ? In the case of the integers, the classical Freiman's theorem provides a partial answer to this question in terms of multi-dimensional arithmetic progressions. Another typical problem is to find a lower bound for in terms of and . This can be viewed as an inverse problem with the given information that is sufficiently small and the structural conclusion is then of the form that either or is the empty set; however, in literature, such problems are sometimes considered to be direct problems as well. Examples of this type include the Erdős–Heilbronn Conjecture (for a restricted sumset) and the Cauchy–Davenport Theorem. The methods used for tackling such questions often come from many different fields of mathematics, including combinatorics, ergodic theory, analysis, graph theory, group theory, and linear algebraic and polynomial methods. (Wikipedia).

Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 1

In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive

From playlist Combinatorics

Introduction to additive combinatorics lecture 1.0 --- What is additive combinatorics?

This is an introductory video to a 16-hour course on additive combinatorics given as part of Cambridge's Part III mathematics course in the academic year 2021-2. After a few remarks about practicalities, I informally discuss a few open problems, and attempt to explain what additive combina

From playlist Introduction to Additive Combinatorics (Cambridge Part III course)

Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 3

In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive

From playlist Combinatorics

Peter Varju: Additive combinatorics methods in fractal geometry - lecture 2

In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive

From playlist Combinatorics

Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 2

From playlist Combinatorics

Discrepancy of generalized polynomials by Anirban Mukhopadhyay

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

Kemperman's Critical Pair Theory by David Grynkiewicz

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

Additive Number Theory: Extremel Problems and the Combinatorics....(Lecture 3) by M. Nathanson

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

1. A bridge between graph theory and additive combinatorics

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX In an unsuccessful attempt to prove Fermat's last theorem

From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019

Zero-Sum Problems by R. Thangadurai

From playlist Workshop on Additive Combinatorics 2020

The Green - Tao Theorem (Lecture 2) by Gyan Prakash

From playlist Workshop on Additive Combinatorics 2020

Additive Energy of Regular Measures in One and Higher Dimensions, and the Fractal... - Laura Cladek

Analysis & Mathematical Physics Topic: Additive Energy of Regular Measures in One and Higher Dimensions, and the Fractal Uncertainty Principle Speaker: Laura Cladek Affiliation: von Neumann Fellow, School Of Mathematics Date: December 14, 2022 We obtain new bounds on the additive energy

From playlist Mathematics

Squares in Arithmetic progression by Shanta Laishram

From playlist Workshop on Additive Combinatorics 2020

Additive number theory: Extremal problems and the combinatorics of sum. (Lecture 4) by M. Nathanson

From playlist Workshop on Additive Combinatorics 2020

Crash Course in Combinatorics | DDC #1

Combinatorics is often a poorly taught topic, because there are a lot of different types of problems. It looks like it is difficult to pin down whether addition or multiplication principle should be used, or whether the inclusion-exclusion principle should be used. This video hopes to be v

From playlist Deep Dive into Combinatorics (DDC)

Peter Varju: Additive combinatorics methods in fractal geometry - lecture 1

From playlist Combinatorics

From graph limits to higher order Fourier analysis – Balázs Szegedy – ICM2018

Combinatorics Invited Lecture 13.8 From graph limits to higher order Fourier analysis Balázs Szegedy Abstract: The so-called graph limit theory is an emerging diverse subject at the meeting point of many different areas of mathematics. It enables us to view finite graphs as approximation

From playlist Combinatorics

Peter Varju: Additive combinatorics methods in fractal geometry - lecture 3

From playlist Combinatorics