Improved Bounds for the Sunflower Lemma
Explore recent progress on the sunflower conjecture, examining structure vs pseudo-randomness and connections to DNF simplification under random restrictions.
Deterministic Approximation of the Ising Partition Function
Explore advanced techniques for approximating the Ising partition function, focusing on deterministic methods and their applications in statistical physics and computational complexity.
X-Ramanujan Graphs
Explore X-Ramanujan graphs and their applications in computer science, focusing on advanced concepts beyond randomized rounding and the probabilistic method in graph theory.
Linear Obstacles in Linear Systems and Ways to Avoid Them
Explore topology in control theory, focusing on obstacle-avoiding paths and cohomology rings using homotopy limits. Gain insights into theoretical computer science applications.
On the Presentability of Artin Differentiable Stacks
Explore the global quotient presentability of Artin stacks in smooth settings, delving into advanced mathematical concepts in differential geometry and algebraic topology.
How Do Exponential Size Solutions Arise in Semidefinite Programming?
Explore the prevalence and implications of exponential size solutions in semidefinite programming, their impact on feasibility determination, and strategies for efficient representation.
Decidability via the Tilting Correspondence
Explore the concept of decidability through the tilting correspondence with Oxford researcher Konstantinos Kartas, delving into advanced mathematical theories and their applications.
First Order Concatenation Theory vs First Order Number Theory
Comparative analysis of first-order concatenation theory and number theory, exploring similarities, differences, and extensions with bounded quantifiers in string-based structures.
Certificates of Nonnegativity and Their Applications in Theoretical Computer Science
Explore nonnegativity certificates in real algebraic geometry, focusing on sums of squares and sums of nonnegative circuit polynomials, with applications to polynomial optimization and theoretical computer science.
The Unreasonable Effectiveness of Mathematics in Large Scale Deep Learning - Lecture 3
Explore the mathematical foundations of large-scale deep learning and their surprising effectiveness in this lecture by Greg Yang, delving into advanced concepts and cutting-edge research.
The Unreasonable Effectiveness of Mathematics in Large Scale Deep Learning - Lecture 2
Explore the mathematical foundations of large-scale deep learning and their surprising effectiveness in this lecture by Greg Yang, delving into advanced concepts and recent developments.
Small-Set Expansion in the 2-Degree Short-Code Graph - The Easier Version
Explore the intricacies of small-set expansion in the 2-degree short-code graph, focusing on an easier version of this complex mathematical concept.
Product Mixing, Quantum Separation, and Comfortable Juntas
Explores product mixing in special unitary groups, solving Gowers' problem and its applications in quantum communication, with sharp results on subset distributions in SU_n.
Representation Theory in TCS and Extremal Combinatorics
Explore how Representation Theory extends Boolean function theory, leading to new insights in theoretical computer science and extremal combinatorics.
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.
Structure of Boolean Almost Low Degree Functions on the Biased Cube
Explores Boolean functions on biased cubes, extending FKN and Kindler-Safra theorems. Analyzes structures for functions close to low degree, including maximum coordinates and decision trees.
Numbers - From Merely Big to Unimaginable - Lecture 9
Explore the fascinating world of enormous numbers, from prime distribution to complex functions, and delve into advanced mathematical concepts like Ackerman operators and Ramsey Theory.
Polylogues
Explore the intersection of math and theoretical computer science with Nikhil Srivastava and Venkatesan Guruswami as they discuss their roles at the Simons Institute and Srivastava's research.
Computability and Problems with Set Theory - Math History
Explores historical controversies in set theory, Gödel's incompleteness theorems, Zermelo-Fraenkel axioms, and Turing's computability concepts, challenging traditional views on infinite sets in mathematics.
Coding for Sunflowers - Theory Seminar
Explore recent advancements in the sunflower conjecture, simplifying proofs and discussing set theory implications in this mathematical theory seminar by Anup Rao.
Interview with Noga Alon - Mathematician with 600 Publications
Interview with mathematician Noga Alon discussing his prolific career, interdisciplinary research, and notable contributions to mathematics, including necklace splitting and applications of the Borsuk-Ulam Theorem.