The vanishing ideal of a finite set of closed points in affine space
Mathias Lederer
Abstract
Given a finite set of closed rational points of affine space over a field, we give a Gröbner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the Buchberger--Möller algorithm, but in contrast to that, we determine the set of leading terms of the ideal without solving any linear equation but by induction over the dimension of affine space. The elements of the Gröbner basis are also computed by induction over the dimension, using one-dimensional interpolation of coefficients of certain polynomials.
Create a lesson
Related papers
On the weak Lefschetz property of Artinian Gorenstein algebras of codimension three in arbitrary characteristic
Omkar Javadekar
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Kathlén Kohn, Giovanni Luca Marchetti, Alex Massarenti et al.
Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals
Trung Chau, Tài Huy Hà, A. V. Jayanthan et al.
Polynomial extensions do not preserve the strong finite type property
Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo et al.
Reduction numbers for witnesses to the generalized Loewy length
Richard Bartels, Sarah Dajani, Gabriel Koomson
Multi-graded generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for d-Leray complexes
Daniel McGinnis