ON THE MINIMAL NUMBER OF NODES UNIQUELY DETERMINING ALGEBRAIC CURVES

Author(s)

ON THE MINIMAL NUMBER OF NODES UNIQUELY DETERMINING ALGEBRAIC CURVES Sofi Toroyan

It is well-known that exactlyN−1n-independent nodes uniquely determinethe curve of degreenpassing through them, whereN=12(n+1)(n+2).It wasproved in [1], that at leastN−4 number ofn-independent nodes are neededto determine the curve of degreen−1 uniquely. The paper has also posed aconjecture concerning the analogous problem for general degreek≤n.In thepresent paper the conjecture is proved, establishing that the minimal number ofn-independent nodes uniquely determining the curve of degreek≤nis equalto(k−1)(2n+4−k)2+2.

DOI: 10.46991/PYSUA.2015.49.3.017 Physical and Mathematical Sciences, 49(3 (238) 17-22

Download PDF

Keywords

polynomial interpolation, poised, independent nodes, algebraic curves

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]