ON THE MINIMAL NUMBER OF NODES UNIQUELY DETERMINING ALGEBRAIC CURVES

Sofi Toroyan

Received N/A; revised N/A; accepted N/A

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Author(s)

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

ON q-LATTICES AND q-ALGEBRAS

ON INCREASING HAZARD RATE OF WAITING TIME IN THE ||1|∞MG MODEL

ON DISTRIBUTION’S CONSTANT SLOWLY VARYING COMPONENT

ON THE MINIMAL NUMBER OF NODES UNIQUELY DETERMINING ALGEBRAIC CURVES

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter