An Invitation to Periodicity
Explore the concept of periodicity in mathematics, its applications, and significance across various fields with expert insights from Gaston Mandata N'Guerekata.
Sunflowers: From Soil to Oil
Explore the mathematical concept of sunflowers, from foundational principles to advanced applications, in this engaging lecture by Anup Rao at the Joint Mathematics Meetings.
Regularity of Solutions to Elliptic Operators and Elliptic Systems
Explore the mathematical intricacies of elliptic operators and systems, focusing on solution regularity in this advanced lecture by renowned mathematician Jill Pipher.
Measuring Singularities - Colloquium 2
Explore advanced mathematical concepts in singularity theory with Karen E. Smith, delving into measurement techniques and their applications in algebraic geometry.
Tropical Geometry and Shallow Water Waves
Explore the fascinating intersection of tropical geometry and shallow water waves in this engaging lecture by Harvard mathematician Lauren Kiyomi Williams.
Graph Algorithms and Coding - Session 5C
Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
Matrix Methods in Computer Science - Session 6B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
Matrix Methods in Computer Science - Session 4B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
Graph Algorithms and Graph Theory - Session 1B
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at FOCS 2020.
Graph Algorithms and Graph Theory - Session 7A
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at the FOCS 2020 conference.
Counting Small Induced Subgraphs Satisfying Monotone Properties
Explore techniques for enumerating small induced subgraphs with specific properties, focusing on algorithmic approaches and complexity analysis in graph theory.
Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Explore efficient algorithms for list coloring graphs on surfaces, focusing on linear time complexity and distributed computing approaches.
Tight Bounds for Online Edge Coloring
Explore cutting-edge algorithms for online edge coloring, examining tight bounds and their implications in graph theory and network optimization.
Faster Minimum k-cut of a Simple Graph
Explore efficient algorithms for finding minimum k-cuts in simple graphs, improving computational speed and complexity for graph partitioning problems.
Efficient Truncated Statistics with Unknown Truncation
Explore efficient methods for analyzing truncated data with unknown truncation points, enhancing statistical inference in various fields of study.
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Explore innovative concepts and techniques for graph and hypergraph sparsification, advancing understanding of network structures and algorithms in computer science.
A Characterization of Graph Properties Testable for General Planar Graphs with One-Sided Error
Explore graph properties testable for general planar graphs with one-sided error, focusing on characterization and analysis techniques.
The Complexity of 3-Colouring H-Colourable Graphs
Explore the intricacies of graph theory, focusing on 3-colouring H-colourable graphs and their computational complexity. Gain insights into advanced mathematical concepts and algorithmic challenges.
Modified Log-Sobolev Inequalities for Strongly Log-Concave Distributions
Explore modified log-Sobolev inequalities and their applications to strongly log-concave distributions in this advanced mathematical analysis presentation.
Parametric Shortest Paths in Planar Graphs
Explore efficient algorithms for computing shortest paths in planar graphs with varying edge weights, enhancing understanding of graph theory and optimization techniques.
Learning Sums of Powers of Low-Degree Polynomials in the Non-Degenerate Case
Explore techniques for learning sums of powers of low-degree polynomials, focusing on non-degenerate cases in this advanced mathematical discussion.