Kovács Fruzsina Édua: Communication complexity problem

Önálló projekt, szakmai gyakorlat II

2024/25 II. félév

Témavezető:
Hegyvári Norbert (ELTE TTK, Matematikatanítási és Módszertani Központ)
Beszámoló:
---
Előadás:
---

The goal of this project is to provide an introduction to some chapter of additive combinatorics (AC) and applications in theoretical computer science. As Ben Green (a leading researcher on the subject) defined: "Well one might say that additive combinatorics is a marriage of number theory, harmonic analysis, combinatorics, and ideas from ergodic theory, which aims to understand very simple systems: the operations of addition and multiplication and how they interact." We will show some nice application of AC e.g. in Communication complexity and in the theory of Boolean functions. One can join a project started with my students (see [3] and [4])