On the Gasca-Maeztu conjecture for n=6

08/14/2022
by   Hakop Hakopian, et al.
0

A two-dimensional n-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most  n. We are interested in correct sets with the property that all fundamental polynomials are products of linear factors. In 1982, M. Gasca and J. I. Maeztu conjectured that any such set necessarily contains n+1 collinear nodes. So far, this had only been confirmed for n≤ 5. In this paper, we make a step for proving the case n=6.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2021

A new proof of the Gasca-Maeztu conjecture for n = 5

An n-correct node set 𝒳 is called GC_n set if the fundamental polynomial...
research
10/18/2019

Lagrange Interpolation Using Orthogonal Polynomials: Stenger's Conjecture, Numerical Approach

In this paper we investigate polynomial interpolation using orthogonal p...
research
10/18/2019

Weighted Lagrange Interpolation Using Orthogonal Polynomials: Stenger's Conjecture, Numerical Approach

In this paper we investigate polynomial interpolation using orthogonal p...
research
12/18/2014

Gray level image enhancement using the Bernstein polynomials

This paper presents a method for enhancing the gray level images. This p...
research
11/30/2017

Exponential lower bounds on spectrahedral representations of hyperbolicity cones

The Generalized Lax Conjecture asks whether every hyperbolicity cone is ...
research
08/20/2019

Decoding Downset codes over a finite grid

In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a d...
research
02/21/2020

Recursive, parameter-free, explicitly defined interpolation nodes for simplices

A rule for constructing interpolation nodes for nth degree polynomials o...

Please sign up or login with your details

Forgot password? Click here to reset