Finite subsets of projective space, and their ideals
Mathias Lederer

TL;DR
This paper investigates the relationship between finite sets of rational points in projective space and their ideals, establishing a connection between the set size and axes in a specific monomial set, and provides an algorithm for computing their Gröbner bases.
Contribution
It introduces a novel relationship between the size of point sets and axes in monomial sets, along with an algorithm for Gröbner basis construction of their ideals.
Findings
Size of point set equals number of axes in monomial set
Algorithm for Gröbner basis construction provided
Enhanced understanding of ideals of finite projective point sets
Abstract
Let be a finite set of closed rational points in projective space, let be the vanishing ideal of , and let be the set of exponents of those monomials which do not occur as leading monomials of elements of . We show that the size of equals the number of axes contained in . Furthermore, we present an algorithm for the construction of the Gr\"obner basis of , hence also of .
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
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · Advanced Numerical Analysis Techniques
