English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

An $n$-poised node set $\mathcal X$ in the plane is called $GC_n$ set, if the fundamental polynomial of each node is a product of linear factors. A line is called $k$-node line, if it passes through exactly $k$-nodes of $\mathcal X.$ At most $n+1$ nodes can be collinear in $\Xset$ and an $(n+1)$-node line is called maximal line. The well-known conjecture of M. Gasca and J.I. Maeztu states that every $GC_n$ set has a maximal line. Until now the conjecture has been proved only for the cases $n \le 5.$ In this paper we prove some results concerning $n$-node lines, assuming that the Gasca--Maeztu conjecture is true.

ON $n$-NODE LINES IN $GC_n$ SETS