Graph Connectivity Using Star Contraction
Explore edge connectivity in simple graphs using cut queries, introducing star contraction for efficient graph simplification and discussing randomized and quantum algorithms for connectivity determination.
Linear Sketching Hypergraph Sparsifiers
Explore linear sketching techniques for hypergraph sparsification, examining upper and lower bounds, dynamic streaming algorithms, and novel methods like random fingerprinting for efficient cut preservation.
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
Explore cut sparsification of hypergraphs, focusing on submodular functions. Learn about new bounds, polynomial bounds, and succinct representation techniques for various submodular function families.
The Approximate Structure of Triangle-Free Graphs
Explore the structure of dense triangle-free graphs and learn about efficient algorithms for computing their approximate representations using smaller graphs.
Maximal Matching in Bounded-deletion Streams
Explore maximal matching in bounded-deletion graph streams, analyzing space complexity as a function of deletion parameter K. Gain insights into algorithmic techniques and lower bound results.
Graphs with Large Edge Weights for Shortest Path Structure - Sublinear Graph Simplification
Explore the relationship between graph shortest paths and edge weight ratios, examining reweighting techniques to preserve path structures.
How to Read Math in Deep Learning Papers - A 5-Step Process
Learn a 5-step method to decipher mathematical formulas in deep learning papers, enhancing your understanding and intuition of complex AI concepts.
The Mysterious Kronecker Coefficients in Algebraic Combinatorics
Explore the enigmatic Kronecker coefficients, their significance in algebraic combinatorics, and recent developments in positivity, asymptotics, and computational complexity.
Analytic Methods in Arithmetic
Explore advanced analytic techniques in arithmetic, focusing on their applications and theoretical foundations in number theory.
Fractal Weyl Bounds
Explore fractal Weyl bounds in spectral geometry with Anke Pohl, delving into advanced mathematical concepts and their applications.
Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications
Explore efficient algorithms for power-sum decomposition of polynomials, improving on prior work for tensor decomposition and Gaussian mixture identifiability. Gain insights into numerical linear algebra and noise-resilient techniques.
Off-Diagonal Spectral Cluster Asymptotics on Zoll Manifolds
Explore off-diagonal spectral cluster asymptotics on Zoll manifolds, examining universal asymptotic behavior of spectral cluster kernels and implications for monochromatic random waves in Riemannian geometry.
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.
Around the Alexandrov-Fenchel Inequality - Convex Geometry and Its Applications
Explore the history and recent progress in convex geometry, focusing on Minkowski's theory and its connections to various mathematical disciplines.
Polynomial Bounds on Reidemeister Moves in Knot Theory
Explore polynomial bounds on Reidemeister moves in knot theory, examining algorithms for trivial knot recognition and the relationship between diagram complexity and move sequences.
The Chromatic Number of Random Graphs
Explore the chromatic number of random graphs, focusing on lower bounds for G(n,1/2) and its limiting distribution. Discover recent advancements in graph theory and probabilistic methods.
Growth in Tensor Powers
Explore tensor power decomposition in group representations, focusing on asymptotic behavior and non-negligible summands using symmetric tensor category theory.
Geometric Stability of Weyl's Law and Applications to Asymptotic Spectral Shape Optimization
Explore geometric stability of Weyl's law and its applications to asymptotic spectral shape optimization, focusing on eigenvalue behavior in bounded Lipschitz domains.
Hypertrees in Combinatorics and Graph Theory
Explore hypertrees with Professor Nati Linial, delving into combinatorics, algorithms, and their applications in computer science and mathematics.
Combinatorial Testing Problems - Lecture 1
Explore combinatorial testing problems, including hidden clique and high-dimensional random geometric graphs, with insights on statistical challenges and estimation techniques.
Growth in Tensor Powers
Explore tensor power decomposition in group representations, focusing on asymptotic behavior and non-negligible summands using symmetric tensor category theory.