Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
Introduction to Parameterized Algorithms and Applications
Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.
Approximation Algorithms for Hard Augmentation Problems - Lecture II
Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.
Introduction to Interior Point Methods for Discrete Optimization, Lecture I
Explore interior point methods for optimization, their recent advancements, and applications in solving various continuous and combinatorial problems efficiently.
Blet, a Mathematical Puzzle - Fernando Rodriguez Villegas
Explore the intriguing mathematics behind the Blet puzzle, involving lattice path geometry and SL(2,R) group theory. Discover why greedy algorithms fail in this discrete minimization problem.
Phase-Field Models for Motion by Mean Curvature - Lecture 4
Explore advanced mathematical concepts in phase-field models and their application to motion by mean curvature, presented by a renowned expert from the University of Chicago.
Transseries, Model Theory, and Hardy Fields - Lecture 14
Explore advanced mathematical concepts in transseries, model theory, and Hardy fields with expert Lou van den Dries in this graduate-level lecture from the Fields Institute.
Transseries, Model Theory, and Hardy Fields - Lecture 9
Explore advanced mathematical concepts in transseries, model theory, and Hardy fields with Professor Lou van den Dries in this graduate-level lecture from the Fields Institute.
Surreal Numbers and Transseries - Lecture 3
Explore advanced mathematical concepts of surreal numbers and transseries, delving into their properties, applications, and connections to asymptotic analysis.
Surreal Numbers and Transseries - Lecture 2
Explore advanced mathematical concepts of surreal numbers and transseries, delving into their properties and applications in asymptotic analysis.
Transseries, Model Theory, and Hardy Fields - Lecture 1
Explore advanced mathematical concepts in transseries, model theory, and Hardy fields with Professor Lou van den Dries in this graduate-level lecture series.
Surreal Numbers and Transseries - Lecture 1
Explore surreal numbers and transseries in this graduate-level lecture, delving into advanced mathematical concepts and their applications in asymptotic analysis.
On the Oriented Coloring of the Disjoint Union of Graphs
Explore oriented graph coloring in disjoint unions, examining theoretical aspects and algorithmic implications in combinatorial algorithms.
Induced Subgraphs and Tree Decompositions
Explore induced subgraphs and tree decompositions in graph theory, focusing on their properties, applications, and recent advancements in combinatorial algorithms.
Linear Matroid Matching in the Oracle Model
Explores linear matroid matching in the oracle model, replacing linear algebraic computation with repeated oracle-calls along alternating paths to solve challenging problems in connectivity, rigidity, and count matroids.
Dimension, Complexity and K Theory
Explore connections between dimension theory, complexity, and K-theory in mathematics, focusing on applications in topology and geometry. Gain insights into cutting-edge research in these interconnected fields.
Derek Holt- Algorithms for Finitely Presented Groups I
Explore fundamental algorithms for computing in finitely presented groups, including Todd-Coxeter coset enumeration and Reidemeister-Schreier algorithm, with practical examples and applications.
Derek Holt- Algorithms for Finitely Presented Groups II
Explore advanced algorithms for finitely presented groups, including Todd-Coxeter coset enumeration, Reidemeister-Schreier algorithm, and automatic structures. Learn applications in group theory computations.
Complexity and Invariants of Knot Diagrams, Curves, and Surfaces
Explore complexity and invariants in knot diagrams, curves, and surfaces with Tahl Nowik. Gain insights into advanced topological concepts and their applications in quantum topology.
Non Linear Programming
Explore advanced optimization techniques including convex, quadratic, separable, geometric, and dynamic programming, as well as search methods and numerical integration.
Mathematics in Computer Animation - Pixar's Approach
Pixar engineer explores mathematical techniques behind computer-animated effects, including dynamic simulations for clothing, hair, and 3D interactive animation, showcasing real-world applications in film production.