Hypertrees in Combinatorics and Graph Theory
Offered By: BIMSA via YouTube
Course Description
Overview
Explore the concept of hypertrees in this one-hour lecture by Professor Nati Linial, a renowned expert in Combinatorics and Theory of Algorithms from the Hebrew University of Jerusalem. Delve into the intricate world of combinatorial mathematics as presented by a distinguished scholar who has received numerous accolades, including the Inaugural FOCS "Test of Time" Award, the Rothschild Prize, and the Dijkstra Prize. Gain insights from a researcher with over 150 published papers and an invited speaker at the International Congress of Mathematicians. Learn about the applications of geometry and analysis in computational molecular biology and discover how hypertrees contribute to advancing our understanding of complex mathematical structures.
Syllabus
Nati Linial: Hypertrees
Taught by
BIMSA
Related Courses
Introduction to High Dimensional Expanders - Irit DinurInstitute for Advanced Study via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube Graph Representation Learning and Its Applications to Biomedicine
Applied Algebraic Topology Network via YouTube Asaf Shapira - Local vs Global Combinatorics
International Mathematical Union via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture II
Hausdorff Center for Mathematics via YouTube