New bounds on curve tangencies and orthogonalities
Jordan S. Ellenberg, Jozsef Solymosi, Joshua Zahl

TL;DR
This paper establishes new upper bounds on the number of tangency and orthogonality points among algebraic plane curves, using polynomial methods and space curve arrangements, advancing combinatorial geometry understanding.
Contribution
It introduces novel bounds on curve tangencies and orthogonal intersections, applying polynomial techniques and space curve transformations to improve previous estimates.
Findings
Bound of O(n^{3/2}) for tangency points among n algebraic curves.
Bound of O(n^{3/2}) for orthogonal intersections unless special properties occur.
Use of polynomial method and space curve arrangements to derive bounds.
Abstract
We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of algebraic plane curves, we show that there are points where two or more curves are tangent. In particular, if no three curves are mutually tangent at a common point, then there are curve-curve tangencies. Second, given a family of algebraic plane curves and a set of curves from this family, we show that either there are points where two or more curves are orthogonal, or the family of curves has certain special properties. We obtain these bounds by transforming the arrangement of plane curves into an arrangement of space curves so that tangency (or orthogonality) of the original plane curves corresponds to intersection of space curves. We then bound the number of intersections of the corresponding…
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
TopicsAdvanced Numerical Analysis Techniques · Polynomial and algebraic computation · Point processes and geometric inequalities
