Sums and products along edges of sparse graphs
Jozsef Solymosi (UBC)
01-Jun-2020, 16:00-17:00 (4 years ago)
Abstract: In their seminal paper Erdős and Szemerédi formulated conjectures on the size of sum set and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph, when we consider sums and products of some pairs only. With Noga Alon and Imre Ruzsa we showed that this strong form of the Erdős-Szemerédi conjecture does not hold. In this talk I will list some related problems and recent results.
combinatoricsnumber theory
Audience: researchers in the topic
Webinar in Additive Combinatorics
Series comments: Signup via homepage to receive email notification and Zoom link for upcoming Webinars in Additive Combinatorics.
Organizer: | Sean Prendiville* |
*contact for this listing |
Export talk to