Hypergraph Rainbow Problems, Kikuchi Matrices, and Local Codes
International Centre for Theoretical Sciences via YouTube
AI Adoption - Drive Business Value and Organizational Impact
Our career paths help you become job ready faster
Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intricate connections between hypergraph rainbow problems, Kikuchi matrices, and local codes in this 52-minute conference talk delivered at the ICTS Workshop on High Dimensional Expanders and Codes. Delve into advanced mathematical concepts that bridge combinatorics, coding theory, and high-dimensional expansion through the lens of rainbow colorings in hypergraphs and their applications to error-correcting codes. Examine how Kikuchi matrices serve as a crucial tool for analyzing local properties of codes and understanding the geometric structure underlying these mathematical objects. Discover the theoretical foundations that connect these seemingly disparate areas and learn about recent developments in the intersection of high-dimensional expanders and coding theory. Gain insights into cutting-edge research methodologies and proof techniques used to tackle complex problems in theoretical computer science and mathematics, particularly those involving locally testable and locally decodable codes.
Syllabus
Hypergraph Rainbow Problems, Kikuchi Matrices, and Local Codes by Pravesh Kothari
Taught by
International Centre for Theoretical Sciences