Extensions of planar GC sets and Syzygy matrices (Q2000490): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10444-018-9630-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2890203788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomial interpolation: conjectures concerning GC-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5285811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of bivariate configurations with simple Lagrange interpolation formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of lattices of points for bivariate interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric characterization and generalized principal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5432185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized principal lattices and cubic pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Configurations of nodes with defects greater than three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of sets satisfying the geometric characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observations on interpolation by total degree polynomials in two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lattices Admitting Unique Lagrange Interpolations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Interpolation in Higher Dimension: From Simplicial Complexes to GC Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrange and Hermite interpolation in \(R^ k\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gasca-Maeztu conjecture for \(n=5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur mechanischen Kubatur / rank
 
Normal rank

Latest revision as of 18:37, 19 July 2024

scientific article
Language Label Description Also known as
English
Extensions of planar GC sets and Syzygy matrices
scientific article

    Statements

    Extensions of planar GC sets and Syzygy matrices (English)
    0 references
    0 references
    0 references
    28 June 2019
    0 references
    The authors study ordinary Lagrange interpolation in the space \(\mathbb{R}^k\ (k\geq 1)\). The concepts \(P\)-\textit{correct}, \(GC_n\) sets and \textit{maximal lines} in the set of nodes play a role. {Definition 1.1.} A finite set of nodes \(X\subset\mathbb{R}^k\) is \(P_n\)-correct if the Lagrange interpolation problem on \(X\) has in \(P_n\) (the space of polynomials of total degree \(\leq n\)). {Definition 2.2.} Let \(X\subset\mathbb{R}^2\) be a \(P_n\) correct set. A \textit{maximal line for} \(X\) is any line \(L\) containing \(n+1\) nodes, i.e. \(\# (L\cap X)=n+1\). The set of maximal lines of a \(P_n\) correct set \(X\) will be denoted by \(M(X)\). {Definition 2.6.} The \textit{defect} of a \(P_n\) correct set \(X\subset \mathbb{R}^2,\ n\geq 1\), is the number \(d(X)=n+2-\# M(X)\). {Definition 3.1.} A \(GC_n\) set \(X\subset \mathbb{R}^2\) is a set with \(\# X=\binom{n+2}{2}\), such that for each \(x\in X\) there exists a set of lines \(\Lambda_{x,X}\), containing all points in \(X\) but \(x\), i.e., \(X\setminus \bigcup_{K\in \Gamma_{x,X}} K=\{x\}\). The conjecture now reads {Conjecture 3.3.} (Gasca-Maeztu conjecture) The set of maximal lines of a \(GC_n\) set is non-empty, that is: there exists at least one line of the plain containing exactly \(n+1\) nodes. Up to now it remains unsolved for \(n\geq 6\). The authors claim that the study of so-called Syzygy matrices of \(GC\) sets gives a promising approach to the problem. The layout of the paper is as follows: {\S1.} Introduction {\S2.} Maximal lines of interpolation sets {\S3.} The classification of planar \(GC\) sets contains 2 propositions and 5 theorems {\S4.} Extension of a \(GC\) set consists of extending a \(GC_n\) set \(X\) to a \(GC_n\) set \(X'\) having the same defect, by adding \(n+2\) collinear nodes to \(X\) {\S5.} Syzygy matrices of \(GC\) sets \begin{itemize} \item[--] a Syzygy of an \((n+2)\)-tuple \((h_0,\ldots,h_{n+1})\in P^{n+2}\) is another \((n+2)\)-tuple of polynomials \((s_0,\ldots,s_{n+1}) \in P^{n+2}\), such that \(\sum_{i=0}^{n+1}\,s_ih_i=0\), \item[--] a Syzygy matrix \(\Sigma\) of \((h_0,\ldots, h_{n+1})\) is a matrix with polynomial entries, whose rows are Syzygies. \end{itemize} References contains 19 items.
    0 references
    0 references
    0 references
    0 references
    0 references
    total degree bivariate interpolation
    0 references
    geometric characterization
    0 references
    Syzygy matrices
    0 references
    0 references