This talk considers some of the recent results on n-independent, n-correct, and GCn sets, concerning the Gasca-Maeztu conjecture.
Statement
This talk considers some of the recent results on n-independent, n-correct, and GCn sets, concerning the Gasca-Maeztu conjecture. Along with the maximal line we consider also line passing through exactly n- nodes, as well as the subset of the nodes in an n-correct set that use a given line. Next, the space of curves of given degree passing through the points of an n-independent set of certain cardinality is studied and a characterization for an extremal case is provided. Denote the space of all bivariate polynomials of total degree not exceeding n by Πn . We have that N := Nn := dim Πn = (1/2)(n + 1)(n + 2). On n-independent, n-correct, and GCn sets Hakop Hakopian
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.