On the unique minimal monomial basis of Birkhoff interpolation problem (Q328235)

Both a new algorithm for computing the so-called minimal monomial basis related to the \(n\)-variate Birkhoff interpolation problem is proposed, and a uniqueness criterion is provided to guarantee that the said minimal monomial basis related to the \(n\)-variate Birkhoff interpolation problem is unique. The minimality used is with respect to lexicographic ordering. The Birkhoff interpolation problem used in this article is defined very generally over a field and a polynomial ring over a field. The algorithm mentioned is an efficient way (i.e., it has low computational cost) to compute a minimal monomial basis; it is called B-Lex method, in generalization to the so-called lex game algorithm. An intuitive geometric meaning of the new Lex algorithm is outlined and several computational examples are given, too.