Combinatorial and Computational Geometry: Tutorials - IPAM

Combinatorial and Computational Geometry: Tutorials

Part of the Long Program Algebraic Techniques for Combinatorial and Computational Geometry
March 11 - 14, 2014

Schedule

All times in this Schedule are Pacific Time (PT)

Tuesday, March 11, 2014

Morning Session

08:00-09:00
Check-In/Light Breakfast (Hosted by IPAM)
09:00-10:15
Imre Barany (Renyi Institute of Mathematics)
(1) The Combinatorial Nullstellensatz
10:15-10:45
Break
10:45-12:00
Saugata Basu (Purdue University)
Combinatorial, algebraic and topological complexity of semi-algebraic sets

Afternoon Session

12:00-12:30
Core Orientation with IPAM Staff
12:30-14:00
Lunch (on your own)
14:00-15:15
Neil Lyall (University of Georgia)
(1) An Introduction to the Falconer Distance, Kakeya and Restriction Conjectures
14:00-15:15
Neil Lyall (University of Georgia)
(1) An Introduction to the Falconer Distance, Kakeya and Restriction Conjectures
15:15-15:45
Break
15:45-17:00
Nathan Kaplan (University of California, Irvine (UCI))
Polynomials over Finite Fields and the Finite Field Kakeya Conjecture

Wednesday, March 12, 2014

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-10:15
Imre Barany (Renyi Institute of Mathematics)
(2) The Combinatorial Nullstellensatz
10:15-10:45
Break
10:45-12:00
Saugata Basu (Purdue University)
Combinatrial complexity in o-minimal structures

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:15
Neil Lyall (University of Georgia)
(2) An Introduction to the Falconer Distance, Kakeya and Restriction Conjectures
15:15-15:45
Break
15:45-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(1) Introduction to combinatorial geometry via hard Erdős problems
15:45-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(1) Introduction to combinatorial geometry via hard Erdős problems

Thursday, March 13, 2014

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-10:15
Jozsef Solymosi (University of British Columbia)
Combinatorical applications of the Subspace Theorem
10:15-10:45
Break
10:45-12:00
Ernest Croot (Georgia Institute of Technology)
Almost-periodic convolutions

Afternoon Session

12:00-14:30
On-Campus Excursion
14:30-15:30
Misha Rudnev (University of Bristol)
Applications of incidence theorems to questions of sum-product type
15:30-16:00
Break
16:00-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(2) Introduction to combinatorial geometry via hard Erdős problems
16:00-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(2) Introduction to combinatorial geometry via hard Erdős problems

Friday, March 14, 2014

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-10:15
Jozsef Solymosi (University of British Columbia)
Elementary Additive Combinatorics
10:15-10:45
Break
10:45-12:00
Shachar Lovett (University of California, San Diego (UCSD))
Applications of additive combinatorics in theoretical computer science

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-15:15
Nets Katz (California Institute of Technology)
The impact of the Kakeya problem on combinatorial geometry and vice versa
15:15-15:45
Break
15:45-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(3) Introduction to combinatorial geometry via hard Erdős problems
15:45-17:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)
(3) Introduction to combinatorial geometry via hard Erdős problems
Printable Version