BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Analysis seminar
SUMMARY:Hunter\, Cauchy Rabbit\, and Optimal Kakeya Sets -
Perla Sousi (Cambridge)
DTSTART:20130131T140000Z
DTEND:20130131T150000Z
UID:TALK969AT
URL:/talk/index/969
DESCRIPTION:A planar set that contains a unit segment in every
direction is called a Kakeya set. These sets have
been studied intensively in geometric measure the
ory and harmonic analysis since the work of Besico
vich (1928)\; we find a new connection to game the
ory and probability. A hunter and a rabbit move on
the integer points in [0\,n) without seeing each
other. At each step\, the hunter moves to a neighb
oring vertex or stays in place\, while the rabbit
is free to jump to any node. Thus they are engaged
in a zero sum game\, where the payoff is the capt
ure time. The known optimal randomized strategies
for hunter and rabbit achieve expected capture tim
e of order n log n. We show that every rabbit stra
tegy yields a Kakeya set\; the optimal rabbit stra
tegy is based on a discretized Cauchy random walk\
, and it yields a Kakeya set K consisting of 4n tr
iangles\, that has minimal area among such sets (t
he area of K is of order 1/log(n)). Passing to th
e scaling limit yields a simple construction of a
random Kakeya set with zero area from two Brownian
motions. (Joint work with Y. Babichenko\, Y. Per
es\, R. Peretz and P. Winkler).
LOCATION:Physics Poynting Small LT
CONTACT:Neal Bez
END:VEVENT
END:VCALENDAR