Abstract

Let the set of nodes $ \LARGE{x} $ in the plain be $ n $-independent, i.e., each node has a fundamental polynomial of degree $ n $. Suppose also that $ \vert \LARGE{x} \normalsize \vert \mathclose{=} (n \mathclose{+} 1) \mathclose{+} n \mathclose{+} \cdots \mathclose{+} (n \mathclose{-} k \mathclose{+} 4) \mathclose{+} 2 $ and $ 3 \mathclose{\leq} k \mathclose{\leq} n \mathclose{-} 1 $. We prove that there can be at most 4 linearly independent curves of degree less than or equal to $ k $ passing through all the nodes of $ \LARGE{x} $. We provide a characterization of the case when there are exactly 4 such curves. Namely, we prove that then the set $ \LARGE{x} $ has a very special construction: all its nodes but two belong to a (maximal) curve of degree $ k \mathclose{-} 2 $. At the end, an important application to the Gasca-Maeztu conjecture is provided.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.