Curves in R^d intersecting every hyperplane at most d+1 times
From MaRDI portal
(Redirected from Publication:343098)
Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2106994 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- A note on order-type homogeneous point sets
- Chebyshev systems and zeros of a function on a convex curve
- Higher-order Erdős-Szekeres theorems
- ON TWO CONJECTURES CONCERNING CONVEX CURVES
- Projective convexity in \({\mathbb{P}}^ 3\) implies Grassmann convexity.
- Ramsey-type results for semi-algebraic relations
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)
