Graph Theory
Explore fundamental concepts of Graph Theory, from social distancing applications to advanced theorems, enhancing problem-solving skills and mathematical understanding.
Design and Analysis of Algorithms - Complete Course in Hindi
Comprehensive Hindi explanation of Design and Analysis of Algorithms, covering key topics from searching to hashing, with free downloadable notes for in-depth understanding.
An Introduction to Homology - Algebraic Topology
Explore higher-dimensional topology through homology groups, cycles, and spanning trees. Learn to compute and characterize independent cycles in graphs using algebraic techniques.
Real-Rooted Polynomials
Explore real-rooted polynomials, their properties, and connections to combinatorics in this comprehensive lecture covering fundamental theorems, root interlacing, and applications to random spanning trees.
Reassembling Trees for the Traveling Salesman
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
On Variants of Specht Polynomials and Random Geometry
Explore connections between Specht polynomials, conformal field theory, and random geometry. Discover algebraic structures in statistical mechanics models and their geometric interpretations.
Geometric Bounds for Spanning Tree Entropy of Planar Lattices
Explores geometric bounds for spanning tree entropy in planar lattices, connecting hyperbolic geometry, number theory, probability, and graph theory. Discusses conjectures and recent progress.
One-ended Spanning Trees in Amenable Group Actions
Explore one-ended spanning trees in free Borel actions of amenable groups, with applications to Borel combinatorics. Discover related results in Baire measurable and Borel settings.
Distribution Learning Meets Graph Structure Sampling
Explore the connection between PAC-learning of graphical models and efficient graph structure sampling, leveraging online learning algorithms for new insights in high-dimensional distribution learning.
One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies
Explore polylogarithmic universal Steiner trees and strong sparse partition hierarchies. Learn about new constructions improving approximation guarantees and matching logarithmic lower bounds.