Thesis supervisor: Péter Pál Pach
Location of studies (in Hungarian): Department of Computer Science and Information Theory Abbreviation of location of studies: SZIT
Description of the research topic:
The goal is to study and solve various problems from Arithmetic Combinatorics, which is a relatively young but quickly expanding area of Mathematics.A typical question to be investigated is how large a subset of the integers (or a finite group) avoiding a certain arithmetic configuration (for instance, a k-term arithmetic progression, a zero-sum, etc) can be. Special attention would be devoted to algebraic methods, and the nature of the problems predicts that applications in related fields like Number Theory and Computer Science are also expected.
Required language skills: English Number of students who can be accepted: 1