Suppose we sample each natural number with probability p, independently. Let the resulting set be denoted by A. What is the probability that there are more than, say, m natural numbers which cannot be represented as a sum of k numbers from A? We have recently obtained sharp bounds in the case k = 2 (arxiv:2605.29680). The goal of this project would be to generalise the methods to arbitrary k.
Supervisors
Primary Supervisor: Rajko Nenadov
Key qualifications and skills
A/A+ in MATH120, MATH203, MATH220, MATH240
Does the project come with funding
No - Student must be self-funded
Final date for receiving applications
Ongoing
How to apply
Apply by email to primary supervisor
Keywords
Combinatorics, probability
