Zero sets of polynomials in several variables

Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k, n \in \mathbb{N}$$\end{document}, where n is odd. We show that there is an integer N  =  N(k, n) such that for every n-homogeneous polynomial \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P : \mathbb{R}^N \rightarrow \mathbb{R}$$\end{document} there exists a linear subspace \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X \hookrightarrow \mathbb{R}^N, \dim X = k$$\end{document}, such that P|X ≡ 0. This quantitative estimate improves on previous work of Birch et al., who studied this problem from an algebraic viewpoint. The topological method of proof presented here also allows us to obtain a partial solution to the Gromov-Milman problem (in dimension two) on an isometric version of a theorem of Dvoretzky.