On Combinatorial Properties of Points and Polynomial Curves
Hiroyuki Miyata

TL;DR
This paper introduces degree-k oriented matroids to characterize the combinatorial properties of point set partitions in the plane by polynomial graphs, extending the classical oriented matroid theory.
Contribution
It defines degree-k oriented matroids and proves they fully characterize partitions from polynomial graphs, linking them to signotopes and hyperplane arrangements.
Findings
Degree-k oriented matroids characterize polynomial graph partitions.
Equivalence between degree-k oriented matroids and (k+2)-signotopes.
Provides geometric interpretation for signotopes and hyperplane arrangements.
Abstract
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact, Goodman and Pollack (Journal of Combinatorial Theory, Series A, Volume 37, pp. 257-293, 1984) proved that the axioms of oriented matroids of rank completely characterize the sets of possible partitions arising from a natural topological generalization of configurations of points and lines. In this paper, we introduce a new class of oriented matroids, called degree- oriented matroids, which captures essential combinatorial properties of the possible partitions of point sets in the plane by the graphs of polynomial functions of degree . We prove that the axiom of degree- oriented matroids completely characterizes the sets of possible…
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
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Advanced Numerical Analysis Techniques
