témavezető: Pach Péter Pál
helyszín (magyar oldal): Department of Computer Science and Information Theory helyszín rövidítés: BME
A kutatási téma leírása:
The polynomial method has a wide range of applications in combinatorics, just briefly mentioning some of these: For example, the Cauchy-Davenport theorem, the Erdős-Heilbronn conjecture (Hamidoune-da Silva theorem), the Erdős-Ginzburg-Ziv theorem can be proved with the help of it, or as one of the most recent ones we could mention Dvir's proof for the finite field Kakeya-problem.
In 2016 with Croot and Lev we developed a new variant of the polynomial method which enabled us to prove Roth-type theorems in certain finite groups, and till then many other applications have been found. Specially, the method lead to the solution of the cap set problem (Ellenberg-Gijswijt),
the Erdős-Szemerédi sunflower conjecture (the currently best bound is due to Naslund and Sawin who used this new method) and a tight bound for Green's arithmetic triangle lemma. The method has applications as well: For example, the applicability of STTP (simultaneous triple product property) in reducing the number of steps in matrix multiplication.
The aim of the research is to find more generalizations and applications of this new and other combinatorial methods, moreover to examine the applications of them.
előírt nyelvtudás: angol további elvárások: basic knowledge of number theory
felvehető hallgatók száma: 1
Jelentkezési határidő: 2024-05-31
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Bejelentkezés
