Prime numbers and automatic sequences: determinism and randomness / Nombres premiers et suites automatiques : aléa et déterminisme

Collection Prime numbers and automatic sequences: determinism and randomness / Nombres premiers et suites automatiques : aléa et déterminisme

Organizer(s) Dartyge, Cécile ; Drmota, Michael ; Martin, Bruno ; Mauduit, Christian ; Rivat, Joël ; Stoll, Thomas
Date(s) 5/22/17 - 5/26/17
linked URL http://conferences.cirm-math.fr/1595.html
00:00:00 / 00:00:00
5 5

Small sumsets in continuous and discrete settings

By Anne de Roton

Also appears in collection : Exposés de recherche

Given a subset A of an additive group, how small can the sumset $A+A = \lbrace a+a' : a, a' \epsilon$ $A \rbrace$ be ? And what can be said about the structure of $A$ when $A + A$ is very close to the smallest possible size ? The aim of this talk is to partially answer these two questions when A is either a subset of $\mathbb{Z}$, $\mathbb{Z}/n\mathbb{Z}$, $\mathbb{R}$ or $\mathbb{T}$ and to explain how in this problem discrete and continuous setting are linked. This should also illustrate two important principles in additive combinatorics : reduction and rectification. This talk is partially based on some joint work with Pablo Candela and some other work with Paul Péringuey.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19171603
  • Cite this video de Roton Anne (5/24/17). Small sumsets in continuous and discrete settings. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19171603
  • URL https://dx.doi.org/10.24350/CIRM.V.19171603

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback