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
9:00 - 10:15
Imre Barany (Renyi Institute of Mathematics)

(1) The Combinatorial Nullstellensatz

10:45 - 12:00
2:00 - 3:15
3:45 - 5:00

Wednesday, March 12, 2014
9:00 - 10:15
Imre Barany (Renyi Institute of Mathematics)

(2) The Combinatorial Nullstellensatz

10:45 - 12:00
 
2:00 - 3:15
3:45 - 5:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)

(1) Introduction to combinatorial geometry via hard Erdős problems
PDF Presentation

 

Thursday, March 13, 2014
9:00 - 10:15
Jozsef Solymosi (University of British Columbia)

Combinatorical applications of the Subspace Theorem

10:45 - 12:00
Ernest Croot (Georgia Institute of Technology)

Almost-periodic convolutions

2:30 - 3:30
4:00 - 5:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)

(2) Introduction to combinatorial geometry via hard Erdős problems
PDF Presentation

 

Friday, March 14, 2014
9:00 - 10:15
Jozsef Solymosi (University of British Columbia)

Elementary Additive Combinatorics

10:45 - 12:00
Shachar Lovett (University of California, San Diego (UCSD))

Applications of additive combinatorics in theoretical computer science
PDF Presentation

 
2:00 - 3:15
3:45 - 5:00
Shakhar Smorodinsky (Ben-Gurion University of the Negev)

(3) Introduction to combinatorial geometry via hard Erdős problems
PDF Presentation