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

DOI10.1145/2582112.2582132zbMATH Open1395.05178OpenAlexW2125043295MaRDI QIDQ4635584FDOQ4635584

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

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582132

Recommendations

• Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
• Cyclic polytopes and d-order curves
• Cutting convex curves
• A crossing lemma for Jordan curves
• scientific article; zbMATH DE number 4142925

zbMATH Keywords

Ramsey theoryChebyshev systemconvex curve

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Ramsey theory (05D10) Other problems of combinatorial convexity (52A37)

Cited In (7)

• A note on the Tolerant Tverberg Theorem
• Universal sequences of lines in \(\mathbb{R}^d\)
• Graph Drawing
• Grassmann convexity and multiplicative Sturm theory. Revisited
• Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
• One-sided epsilon-approximants
• Title not available (Why is that?)

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 Q4635584)