Quasipolynomial Bounds for Some Problems in Extremal Combinatorics

Offered By: Institute for Advanced Study via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Explore a concise conference talk on quasipolynomial bounds in extremal combinatorics. Delve into the research presented by Zander Kelley, a postdoctoral member at the Institute for Advanced Study. Gain insights into the latest developments and challenges in this specialized field of mathematics. Learn about the application of quasipolynomial bounds to various problems in extremal combinatorics and understand their significance in advancing mathematical knowledge. Benefit from this 17-minute presentation that offers a focused look at cutting-edge research in combinatorial mathematics.

Syllabus

Quasipolynomial Bounds for Some Problems in Extremal Combinatorics - Zander Kelley

Taught by

Institute for Advanced Study

Related Courses

Introduction to High Dimensional Expanders - Irit Dinur
Institute 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