2008
DOI: 10.1016/j.jpaa.2007.08.002
|View full text |Cite
|
Sign up to set email alerts
|

The vanishing ideal of a finite set of closed points in affine space

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 on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 15 publications
(39 citation statements)
references
References 8 publications
0
39
0
Order By: Relevance
“…That's why we began to study the vanishing ideal of the set of points with multiplicity structures which is essentially a special case of Birkhoff interpolation problem. I still remember the moment when I first read the paper [2] written by Mathias Lederer in which the quotient basis and Gröbner basis can be got in a geometric way. I told myself that this was just what we wanted.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…That's why we began to study the vanishing ideal of the set of points with multiplicity structures which is essentially a special case of Birkhoff interpolation problem. I still remember the moment when I first read the paper [2] written by Mathias Lederer in which the quotient basis and Gröbner basis can be got in a geometric way. I told myself that this was just what we wanted.…”
Section: Resultsmentioning
confidence: 99%
“…Although whether or not the points are with multiplicity structures matters much, the paper really inspired us a lot. Our algorithm also uses induction over variables and the definition of addition of lower sets is essentially the same with that in paper [2]. However during the induction procedure, we have to consider p-Special case and p-General case.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…I wish to thank the anonymous referee of [Led08] for his positive evaluation of my article, which motivated me to carry on my research on this subject. Many thanks go to B. Heinrich Matzat and his group in Heidelberg, in particular Michael Wibmer, who gave me the opportunity to present my research in a seminar talk.…”
Section: Acknowledgmentsmentioning
confidence: 99%
“…For a discussion of this issue, see [Led08] and references therein. In the present paper, we want to generalise Eq.…”
Section: Introductionmentioning
confidence: 99%