BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Robin Riblet (ENS Paris-Saclay\, France)
DTSTART:20261203T200000Z
DTEND:20261203T210000Z
DTSTAMP:20261107T163506Z
UID:NYNTS/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NYNTS/9/">On
  the largest Sidon subset in a finite subset of R^N</a>\nby Robin Riblet (
 ENS Paris-Saclay\, France) as part of New York Number Theory Seminar\n\n\n
 Abstract\nA set is called a Sidon set if all pairwise sums of its elements
  are distinct\, up to the order of the summands. A classical question in a
 dditive combinatorics\, related to a conjecture of Erd\\H{o}s\, asks how l
 arge a Sidon subset one can always find in an arbitrary finite set.\n\nIn 
 this talk\, I will present a new lower bound showing that every set of $n$
  points in $\\mathbb{R}^N$ contains a Sidon subset of cardinality at least
 \n$$\\left(\\frac{1}{3\\sqrt{3}}+o(1)\\right)\\sqrt{n}.$$ \nIn particular\
 , this improves a previous lower bound of Abbott for finite sets of intege
 rs.\n
LOCATION:https://researchseminars.org/talk/NYNTS/9/
END:VEVENT
END:VCALENDAR