Associativity Testing - Ben Green
Explore associativity testing in discrete mathematics, covering key concepts, theorems, and applications in group theory and additive combinatorics.
Mathematics of Signal Design for Communication Systems and Szemerédi’s and Green-Tao’s Theorems
Explore signal design for communication systems, focusing on orthogonal transmission schemes and their dynamics. Delve into mathematical connections with functional analysis and additive combinatorics.
Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz
Explore set addition, basic lower bounds, and Kneser's Theorem in additive combinatorics. Learn key proofs, including Cauchy-Davenport theorem, and applications to field extensions.
The Selberg Sieve and Large Sieve - Lecture 1
Explore the Selberg Sieve and Large Sieve in number theory, covering linear algebra, duality principles, and applications like the Bombieri-Vinogradov theorem in this advanced mathematics lecture.
The Selberg Sieve - Lecture 1
Explore the Selberg sieve method in number theory, covering heuristics, probability, and applications to twin primes. Learn about sieve techniques for detecting primes in sequences.
Strong Bounds for 3-Progressions
Explore advanced additive combinatorics, focusing on 3-term arithmetic progressions in integer sets. Learn about recent breakthroughs and their implications for number theory.
Structure of Communication - Richard M. Karp Distinguished Lecture
Explore communication complexity, its applications, and structural conjectures in theoretical computer science with Shachar Lovett. Gain insights into efficient communication and its connections to various mathematical domains.
New Frontiers in Structure vs Randomness with Applications to Combinatorics, Complexity, and Algorithms
Explore new frontiers in structure vs randomness, delving into applications in combinatorics, complexity, and algorithms. Gain insights on Erdos-Turan problem and recent advancements in additive combinatorics.
Resolution of the Quadratic Littlewood-Offord Problem
Explore the resolution of the Quadratic Littlewood-Offord problem with expert Mathew Kwan, delving into combinatorics and its probabilistic connections.
On the Erdös-Ginzburg-Ziv Problem in Large Dimension
Explore the Erdös-Ginzburg-Ziv Problem in high dimensions with Professor Lisa Sauermann, delving into advanced combinatorics and number theory concepts.
Quantitative Bounds in the Polynomial Szemerédi Theorem and Related Results
Explore quantitative bounds in polynomial Szemerédi theorem and related problems in additive combinatorics, harmonic analysis, and ergodic theory.
Applications of Additive Combinatorics to Problems in Fractal Geometry
Explore applications of additive combinatorics in fractal geometry, focusing on self-similar sets with overlaps and recent advancements in the field.
Structures in Random Graphs - New Connections
Exploring structures in random graphs, including cliques and independence numbers in Cayley graphs, thresholds for monotone properties, and edge-colorings of bipartite graphs.
Analysis of Boolean Functions at CMU - Additive Combinatorics
Explore additive combinatorics in Boolean functions, covering subspaces, cosets, Hamming balls, and the Fryman region conjecture. Gain insights into advanced theoretical concepts.
Discreteness of Asymptotic Tensor Ranks
Explores discreteness in asymptotic tensor parameters, proving general theorems and new lower bounds for asymptotic subrank of tensors, with applications in algebraic complexity and quantum information.
Linear Stability of the Brunn-Minkowski Inequality
Delve into advanced mathematical concepts exploring the linear stability of Brunn-Minkowski inequality, examining volume control in convex geometry and its connections to additive combinatorics.
A Reverse Minkowski Theorem in Lattice Theory and Geometry
Explore the groundbreaking reverse Minkowski theorem and its applications in complexity theory, cryptography, and algorithms, building on fundamental concepts in geometry of numbers.