3 problems

Gasca–Maeztu conjecture for $GC_n$ sets
arXiv@arxiv
Let a $GC_n$ set be an $n$ -correct set $\mathcal{X}$ in which the fundamental polynomial of every node is a product of $n$ linear factors. Gasca–Maeztu conjecture. Any $GC_n$ set c…
Conjecturesolvedgc-sets polynomial-interpolation
1
Bayramyan–Hakopian conjecture on used lines in $GC_n$ sets
arXiv@arxiv
Assume that the Gasca–Maeztu conjecture holds for all degrees up to $n$ . Let $\mathcal X$ be a $GC_n$ set, let $\ell$ be a $k$ -node line with $2\le k\le n+1$ , and let…
Theoremopencombinatorial-geometry gc-sets polynomial-interpolation
0
Conjectural structure of lines in GC_n sets
arXiv@arxiv
Conjecture concerning $GC_n$ sets. There is an integer $s$ with $2k-n-1\leq s\leq k$ such that
Conjectureopencombinatorial-geometry gc-sets polynomial-interpolation
0

Gasca–Maeztu conjecture for GCnGC_nGCn​ sets