Moduli Spaces in Tropical Geometry
Explore moduli spaces in tropical geometry, examining their structure and applications in algebraic geometry, with insights from Brown University expert Melody Chan.
Jeff and Doug's Excellent Math Adventure
Explore new advances in designs, codes, and cryptography with Jeffrey Dinitz in this engaging 34-minute talk, highlighting recent developments and future directions in the field.
Higher-Order Generalizations of Stability and Arithmetic Regularity
Explore higher-order generalizations of stability and arithmetic regularity in this advanced mathematical workshop, delving into complex concepts and their applications.
Growth in Linear Algebraic Groups and Permutation Groups
Exploración de límites de diámetro en grupos simétricos y algebraicos lineales, con énfasis en técnicas simplificadas y conexiones entre diferentes enfoques matemáticos.
Monica Vazirani- Representations of the Affine BMW Category
Explore Walker's TQFT-motivated construction of affine BMW category representations, their combinatorial description, and implications for affine BMW algebra representations in this advanced mathematics lecture.
Discrete Mathematical Structures
Explore permutations, graphs, functions, and more in this comprehensive study of discrete mathematical structures, covering key concepts and their applications.
Learning From Ranks, Learning to Rank - Jean-Philippe Vert, Google Brain
Explore differentiable approaches to integrate permutations, sorting, and ranking in machine learning, focusing on embedding techniques and relaxation of ranking operators.
The Lonely Runner Conjecture - Simulation and Explanation
Explore the intriguing Lonely Runner Conjecture through simulation, understanding its simplicity and the challenge of proving it conclusively.
Families of Polynomials in Biochemical Reaction Networks
Exploring polynomial systems in biochemical reaction networks, focusing on computational techniques for analyzing families of polynomials with combinatorial structures derived from reaction digraphs.
CW-Complex Nagata Idealizations
Explore advanced mathematical concepts in topology and algebra, focusing on CW-complex Nagata idealizations and their applications in Lefschetz properties.
On Binomial Complete Intersections
Explore the mathematical concept of binomial complete intersections in this advanced lecture, delving into algebraic geometry and its applications in related fields.
Construction of Free and Nearly Free Curves
Explore the mathematical construction of free and nearly free curves, delving into advanced concepts in algebra, geometry, and topology.
High-Dimensional Expanders - Lecture 1
Explore high-dimensional expanders with Irit Dinur, delving into advanced concepts in analysis and theoretical computer science.
High-Dimensional Expanders - Lecture 4
Explore advanced concepts in high-dimensional expanders, focusing on analysis techniques and applications in theoretical computer science.
High-Dimensional Expanders - Lecture 3
Explore advanced concepts in high-dimensional expanders, focusing on analysis techniques and applications in theoretical computer science.
On Perfectly Friendly Bisections of Random Graphs
Explores vertex-isoperimetry expansion in random graphs, using boolean function tools to prove equipartition results with specific neighbor distribution properties across partitions.
Erdős and Shannon: A Story of Probability, Communication, and Combinatorics
Explore the interplay of probability, communication, and combinatorics through the lens of Erdős and Shannon's groundbreaking work in mathematics and information 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.
An Improved Bound for Regular Partitions of Hypergraph of Bounded VC_2 Dimension
Explores improved bounds for regular partitions of 3-uniform hypergraphs with bounded VC_2 dimension, showing polynomial complexity in the degree of regularity.
Correspondence Colouring of Random Graphs
Explore structural results on correspondence chromatic numbers in Erdős-Renyi random graphs, examining predictions, proofs, and conjectures related to Hadwiger's conjecture.
Why Is This 15-Puzzle Impossible? - Numberphile
Professor Steven Bradlow explains the mathematical impossibility of solving certain configurations of the classic 15-puzzle, exploring permutations, invariants, and the fascinating properties of this seemingly simple game.