Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-10T21:31:13.000Z Has data issue: false hasContentIssue false

A Lower Bound on the Size of Lipschitz Subsets in Dimension 3

Published online by Cambridge University Press:  04 July 2003

JIŘÍ MATOUšEK
Affiliation:
Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic (e-mail: matousek@kam.mff.cuni.cz)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set $S\subset \R^d$ is $C$-Lipschitz in the$x_i$-coordinate, where $C>0$ is a real number, if, for every two points $a,b\in S$, we have $|a_i-b_i|\leq C \max\{|a_j-b_j|\sep j=1,2,\ldots,d,\,j\neq i\}$. Motivated by a problem of Laczkovich, the author asked whether every $n$-point set in $\Rd$ contains a subset of size at least $cn^{1-1/d}$ that is $C$-Lipschitz in one of the coordinates, for suitable constants $C$ and $c>0$ (depending on $d$). This was answered negatively by Alberti, Csörnyei and Preiss. Here it is observed that a combinatorial result of Ruzsa and Szemerédi implies the existence of a 2-Lipschitz subset of size $n^{1/2}\varphi(n)$ in every $n$-point set in $\R^3$, where $\varphi(n)\to\infty$ as $n\to\infty$.

Information

Type
Paper
Copyright
2003 Cambridge University Press