BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7699@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20161122T110000
DTEND;TZID=Europe/Paris:20161122T120000
DTSTAMP:20241120T204804Z
URL:https://www.i2m.univ-amu.fr/evenements/a-problem-of-a-sarkozy-on-colou
 red-versions-of-the-lagrange-and-vinogradov-theorems/
SUMMARY:D. Surya Ramana (Harish-Chandra Research Insititute\, Prayagraj): A
  problem of A. Sárközy on coloured versions of the Lagrange and Vinograd
 ov Theorems
DESCRIPTION:D. Surya Ramana: In this talk we describe some progress on the 
 following problem of A. Sárközy. For any integer K≥1\, let s(K) be the
  smallest integer such that when the set of squares is coloured using K co
 lours\, every sufficiently large integer can be written as a sum of at mos
 t s(K) squares of the same colour. Also\, let t(K) be the corresponding in
 teger in the analogous context for the set of primes. The problem is to fi
 nd optimal upper bounds for s(K) and t(K) in terms of K.\narXiv\n\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Surya_Ramana.jpg
CATEGORIES:Séminaire,Ernest
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR