On the usage of lines in GC_n sets

DOI10.1007/S10444-019-09705-WzbMATH Open1435.41002arXiv1807.08182OpenAlexW2963109718WikidataQ127707061 ScholiaQ127707061MaRDI QIDQ2305548FDOQ2305548

Authors: Vahagn Vardanyan, Hakop Hakopian 

Publication date: 11 March 2020

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Abstract: A planar node set $mathcalX,$ with $$ is called $G{C}_n$ set if each node possesses fundamental polynomial in form of a product of $n$ linear factors. We say that a node uses a line $Ax+By+C=0$ if $Ax+By+C$ divides the fundamental polynomial of the node. A line is called $k$-node line if it passes through exactly $k$-nodes of $mathcalX.$ At most $n+1$ nodes can be collinear in $G{C}_n$ sets and an $(n+1)$-node line is called maximal line. The Gasca - Maeztu conjecture (1982) states that every $G{C}_n$ set has a maximal line. Until now the conjecture has been proved only for the cases $nle5.$ Here we adjust and prove a conjecture proposed in the paper - V. Bayramyan, H. H., Adv Comput Math, 43: 607-626, 2017. Namely, by assuming that the Gasca-Maeztu conjecture is true, we prove that for any $G{C}_n$ set $mathcalX$ and any $k$-node line $ell$ the following statement holds: Either the line $ell$ is not used at all, or it is used by exactly $$ nodes of $mathcalX,$ where $s$ satisfies the condition $sigma:=2k-n-1leslek.$ If in addition $sigmage3$ and $mu(mathcalX)>3$ then the first case here is excluded, i.e., the line $ell$ is necessarily a used line. Here $mu(mathcalX)$ denotes the number of maximal lines of $mathcalX.$ At the end, we bring a characterization for the usage of $k$-node lines in $G{C}_n$ sets when $sigma=2$ and $mu(mathcalX)>3.$

Full work available at URL: https://arxiv.org/abs/1807.08182

Recommendations

• On \(n\)-node lines in \(GC_n\) sets
• On the number of lines with \(n\) nodes of \(GC_n\) sets
• Conjectures on \(GC_{n}\) sets
• On the number of line separations of a finite set in the plane
• On a correction of a property of \(GC_{n}\) sets
• Lines in Euclidean Ramsey theory
• On the containment problem for linear sets
• More on lines in Euclidean Ramsey theory
• On graphs supported by line sets
• On sets defining few ordinary lines

zbMATH Keywords

polynomial interpolationGasca-Maeztu conjecturemaximal line\(n\)-poised set\(GC_n\) set

Mathematics Subject Classification ID

Multidimensional problems (41A63) Interpolation in approximation theory (41A05)

Cites Work

• On the uniqueness of algebraic curves passing through \(n\)-independent nodes
• On Lattices Admitting Unique Lagrange Interpolations
• On Lagrange and Hermite interpolation in \(R^ k\).
• A new proof of the Gasca-Maeztu conjecture for \(n=4\)
• On a generalization of the Gasca-Maeztu conjecture
• On a new property of \(n\)-poised and \(GC_n\) sets
• Configurations of nodes with defects greater than three
• Planar configurations with simple Lagrange interpolation formulae
• The Gasca-Maeztu conjecture for \(n=5\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a correction of a property of \(GC_{n}\) sets
• Generation of lattices of points for bivariate interpolation
• Geometric characterization and generalized principal lattices
• Geometric characterization of configurations with defect three
• Extensions of planar GC sets and Syzygy matrices

Cited In (3)

• On \(n\)-node lines in \(GC_n\) sets
• On the basic properties of GCn sets
• On a new property of \(n\)-poised and \(GC_n\) sets

This page was built for publication: On the usage of lines in \(GC_n\) sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305548)