University of Cambridge > Talks.cam > Combinatorics Seminar > Effective results on the size and structure of sumsets

Effective results on the size and structure of sumsets

Add to your list(s) Download to your calendar using vCal

  • UserAled Walker (King's London)
  • ClockThursday 24 February 2022, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact ibl10.

Given a finite set A of integer lattice points in d-dimensional space, in 1992 Khovanskii proved that the size of the iterated sumset NA is given exactly by a polynomial P(N) of degree at most d (once N is sufficiently large). But what does ‘sufficiently large’ mean in practice? Khovanskii’s original proof was ineffective. Via other methods, effective bounds have been proved in a few special cases: when d = 1, due to Nathanson; when the convex hull of A is a d-simplex, due to Curran-Goldmakher; and when |A| = d + 2, also due to Curran-Goldmakher. In this talk I will discuss joint work with Andrew Granville and George Shakan, in which we proved an effective bound in the general setting. I will also discuss our related results on the structure of NA (for large N).

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity