YoVDO

Marina Iliopoulou- Three Polynomial Methods for Point Counting, Lecture III

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Polynomial Method Courses Combinatorics Courses Finite Fields Courses Algebraic Geometry Courses

Course Description

Overview

Explore the third lecture in a series on polynomial methods for point counting, focusing on the slice rank method developed by Croot, Lev, Pach, Ellenberg, and Gijswijt. Delve into how this technique demonstrates that sets with no 3-term arithmetic progressions in finite-field settings are small. Learn about the mathematical principles behind this method and its applications in combinatorial geometry. Gain insights into advanced mathematical concepts and problem-solving techniques used in modern research. Enhance your understanding of polynomial methods and their role in solving complex mathematical problems.

Syllabus

Marina Iliopoulou: Three polynomial methods for point counting, Lecture III


Taught by

Hausdorff Center for Mathematics

Related Courses

The Polynomial Method and the Restriction Problem - Larry Guth
Institute for Advanced Study via YouTube
Additive Number Theory - Extremal Problems and the Combinatorics of Sumsets by M. Nathanson
International Centre for Theoretical Sciences via YouTube
Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz
International Centre for Theoretical Sciences via YouTube
The Restriction Problem and the Polynomial Method - Lecture I
Hausdorff Center for Mathematics via YouTube
Marina Iliopoulou- Three Polynomial Methods for Point Counting, Lecture II
Hausdorff Center for Mathematics via YouTube