Cookies?
Library Header Image
LSE Research Online LSE Library Services

Hunter, Cauchy Rabbit, and optimal Kakeya sets

Babichenko, Yakov and Peres, Yuval and Peretz, Ron and Sousi, Perla and Winkler, Peter (2012) Hunter, Cauchy Rabbit, and optimal Kakeya sets. 1207.6389. arXiv.

[img]
Preview
PDF
Download (779kB) | Preview

Identification Number: 1207.6389

Abstract

A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle $\Z_n$. A hunter and a rabbit move on the nodes of $\Z_n$ without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al (2003) provide strategies for hunter and rabbit that are optimal up to constant factors and achieve probability of capture in the first $n$ steps of order $1/\log n$. We show these strategies yield a Kakeya set consisting of $4n$ triangles with minimal area, (up to constant), namely $\Theta(1/\log n)$. As far as we know, this is the first non-iterative construction of a boundary-optimal Kakeya set. Considering the continuum analog of the game yields a construction of a random Kakeya set from two independent standard Brownian motions $\{B(s): s \ge 0\}$ and $\{W(s): s \ge 0\}$. Let $\tau_t:=\min\{s \ge 0: B(s)=t\}$. Then $X_t=W(\tau_t)$ is a Cauchy process, and $K:=\{(a,X_t+at) : a,t \in [0,1]\}$ is a Kakeya set of zero area. The area of the $\epsilon$-neighborhood of $K$ is as small as possible, i.e., almost surely of order $\Theta(1/|\log \epsilon|)$.

Item Type: Monograph (Other)
Official URL: http://arxiv.org/
Additional Information: © 2012 The Authors
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 23 Nov 2012 11:51
Last Modified: 03 May 2013 11:17
URI: http://eprints.lse.ac.uk/id/eprint/47510

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics