A New Upper Bound for the Heilbronn Triangle Problem

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,600
Published on ● Video Link: https://www.youtube.com/watch?v=Py0RunoF7Hk


Duration: 1:02:40
306 views
9

Cosmin Pohoata (IAS)
https://simons.berkeley.edu/talks/cosmin-pohoata-ias-2023-07-26
Structural Results

We discuss a new upper bound for the Heilbronn triangle problem, showing that for sufficiently
large $n$ in every configuration of $n$ points chosen inside a unit square there exists a triangle
of area less than $n^{-8/7-1/2000}$. This is joint work with Alex Cohen and Dmitrii Zakharov.



Other Videos By Simons Institute for the Theory of Computing


2023-07-29Structure Of Boolean Almost Low Degree Functions On The Biased Cube
2023-07-29Correspondence Colouring of Random Graphs
2023-07-28Structures in Random Graphs: New Connections
2023-07-28Noncommutativity and Rounding Schemes for Combinatorial Optimization Parts 1 & 2
2023-07-28Some Remarks About Quantum and Classical Local Hamiltonian Optimization and SDP Rounding
2023-07-28Structure of Communication | Richard M. Karp Distinguished Lecture
2023-07-28Randomized versus Deterministic Decision Tree Size
2023-07-28Fourier Growth of XOR-Fibers of Communication Protocols
2023-07-27Sign-rank vs Margin
2023-07-27Tight Space Complexity of the Coin Problem
2023-07-27A New Upper Bound for the Heilbronn Triangle Problem
2023-07-26A Polynomial Bogolyubov type Result for the Special Linear Group
2023-07-26Higher-dimensional Expansion of Random Geometric Complexes
2023-07-26Testing Thresholds for High-dimensional Sparse Random Geometric Graphs
2023-07-25An Improved Bound for Regular Partitions of Hypergraph of Bounded VC_2 Dimension
2023-07-25Larger Corner-free Sets in High Dimensions
2023-07-25Top-Down Lower Bounds for Depth-Four Circuits
2023-07-25P-smallness of Increasing Families
2023-07-24Nearly all k-SAT Functions are Unate
2023-07-21Session #3
2023-07-20Survey on Optimization in FL


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Structural Results
Cosmin Pohoata