Curves in R^d intersecting every hyperplane at most d+1 times

From MaRDI portal
Publication:343098

DOI10.4171/JEMS/645zbMATH Open1351.05219arXiv1309.1147OpenAlexW2531181900MaRDI QIDQ343098FDOQ343098


Authors: Imre Bárány, Attila Pór, Jiří Matoušek Edit this on Wikidata


Publication date: 25 November 2016

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Abstract: By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing curves in R^d are often called convex curves and they form an important class; a primary example is the moment curve {(t,t^2,...,t^d):tin[0,1]}. They are also closely related to Chebyshev systems, which is a notion of considerable importance, e.g., in approximation theory. We prove that for every d there is M=M(d) such that every at most d+1 crossing curve in R^d can be subdivided into at most M convex curves. As a consequence, based on the work of Elias, Roldan, Safernova, and the second author, we obtain an essentially tight lower bound for a geometric Ramsey-type problem in R^d concerning order-type homogeneous sequences of points, investigated in several previous papers.


Full work available at URL: https://arxiv.org/abs/1309.1147




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343098)