We consider planar GCn node sets, i.e., n-poised sets whose all n-fundamental polynomials are products of n linear factors. Gasca and Maeztu conjectured in 1982 that every such set possesses a maximal line, i.e., a line passing through n + 1 nodes of the set. Till now the conject...
Open access
Research Article10.9734/arjom/2019/v12i230083
An n-independent set in two dimensions is a set of nodes admitting (not necessary unique) bivariate interpolation with polynomials of total degree at most n: For an arbitrary n-independent node set X we are interested with the property that each node possesses an n-fundamental po...
Open access
Research Article10.9734/BJMCS/2015/18816