Lien 
vers le site de l'ENS
ÉCOLE NORMALE SUPÉRIEUREPARIS
Lien vers l'accueil
lancer la recherche

» Conférences d’après mars 2011 : nouveau site

2900

Séminaire général du Département d’informatique

< précédent | 

Sum-Product Problem: New Generalisations and Applications
Igor Shparlinski (Macquarie University, Australie, ENS)

27 avril 2010

We give a brief survey of recent results related to the sum-product problem which dates back to work of Erdos and Szemeredi (1983), where it is shown that for any set A<+i> of real numbers, at least one of the sets A+A = {a_1 + a_2 : a_1,a_2 in A} and A A = {a_1 a_2 : a_1,a_2 in A} is large. More recently, Bourgain, Katz and Tao (2006) obtained similar results for sets A in prime finite fields. We outline these and several other recent results in this area and also present a diverse scope of their applications to several other problems. Finally we mention several open problems, some of which are motivated by applications to cryptography.

Écouter
pictogrammeformat audio mp3 - 21.19 Mo

- Visualiser
- Télécharger
pictogrammeformat quicktime mov, vidéo à la demande / streaming

Télécharger
pictogrammeFormat pdf - 143.4 Ko

Igor Shparlinski Igor Shparlinski (Macquarie University, Australie, ENS)

En savoir plus

Autres conférences

en informatique