m
• E

F Nous contacter

0

# Documents  de Roton, Anne | enregistrements trouvés : 2

O

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## $k$-sum free sets in $[0,1]$ de Roton, Anne | CIRM H

Multi angle

Research talks;Combinatorics;Number Theory

Let $k > 2$ be a real number. We inquire into the following question : what is the maximal size (inner Lebesque measure) and the form of a set avoiding solutions to the linear equation $x + y = kz$ ? This problem was used for $k$ an integer larger than 4 to guess the density and the form of a corresponding maximal set of positive integers less than $N$. Nevertheless, in the case $k = 3$, the discrete and the continuous setting happen to be very different. Although the structure of maximal sets in the continuous setting is quite easy to describe for $k$ far enough from 2, it is more difficult to handle as $k$ comes closer to 2. Joint work with Alain Plagne. Let $k > 2$ be a real number. We inquire into the following question : what is the maximal size (inner Lebesque measure) and the form of a set avoiding solutions to the linear equation $x + y = kz$ ? This problem was used for $k$ an integer larger than 4 to guess the density and the form of a corresponding maximal set of positive integers less than $N$. Nevertheless, in the case $k = 3$, the discrete and the continuous setting happen to be very ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Small sumsets in continuous and discrete settings de Roton, Anne | CIRM H

Multi angle

Research talks;Combinatorics;Number Theory

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.
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 ...

#### Filtrer

##### Audience

Titres de périodiques et e-books électroniques (Depuis le CIRM)

Ressources Electroniques

Books & Print journals

Recherche avancée

0
Z