On the minimum number of high degree curves containing few points
Mario Huicochea
TL;DR
This paper presents quantitative Sylvester-Gallai results for high degree curves and provides constructions demonstrating the non-triviality of these results.
Contribution
It introduces new quantitative results for high degree curves and offers constructions showing these results are non-trivial.
Findings
Two quantitative Sylvester-Gallai results for high degree curves
Two constructions demonstrating the non-triviality of these results
Abstract
In this paper we state two quantitative Sylvester-Gallai results for high degree curves. Moreover we give two constructions which show that these results are not trivial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Advanced Numerical Analysis Techniques · Computational Geometry and Mesh Generation