Additive bases: change of domain
组织者
本杰明·苏达科夫
演讲者
Boris Bukh
时间
2025年03月11日 17:05 至 18:15
地点
Online
线上
Zoom 787 662 9899
(BIMSA)
摘要
Let A be a set of numbers. What is the most efficient way to cover A by a sumset? For the same set A, the answer will depend on the meaning of the word `number'. In this talk, we discuss how much can the answer change as we go from rational numbers to integers and finally to natural numbers.
Joint work with Peter van Hintum and Peter Keevash.
Joint work with Peter van Hintum and Peter Keevash.
演讲者介绍
Boris proved his first breakthrough result at the age of eleven --- the sum of reciprocals of prime numbers converges! Elated by this success, he vigorously pursued his studies despite various setbacks
that included loss of homeland, loss of weight, and the disproof of his first breakthrough by Euler in 1737. He now works mostly in extremal
combinatorics, a subject that Euler avoided.