|
Macaulay2 Engine
|
PointsComputation<CoeffRing>::points — ideal and standard-monomial basis of a finite point set. More...
Go to the source code of this file.
Classes | |
| class | PointsComputation< CoeffRing > |
PointsComputation<CoeffRing>::points — ideal and standard-monomial basis of a finite point set.
Templated entry point that takes a polynomial ring R, its coefficient ring K, and a DMat<CoeffRing> whose columns are points in K^n, and returns generators of the vanishing ideal I(Pts) subset R plus a one-row matrix of standard monomials forming a K-basis of the quotient R / I(Pts). The generators are produced under the engine's graded-reverse-lex order; the standard-monomial output is the natural Hilbert- function complement.
The #warning at the very top of the file flags it as a branch leftover marked for removal once the host work merges. Engine callers reach this code through the M2 ideal-of-points interfaces in Points-family packages; nothing inside the engine consumes it directly yet.
Definition in file points.hpp.