On the basic properties of GC_n sets

01/13/2020
by   Hakop Hakopian, et al.
0

A planar node set X, with # X=n+22, is called GC_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 if the line is a factor of the fundamental polynomial of the node. A line is called k-node line if it passes through exactly k-nodes of X. At most n+1 nodes can be collinear in any GC_n set and an (n+1)-node line is called a maximal line. The Gasca-Maeztu conjecture (1982) states that every GC_n set has a maximal line. Until now the conjecture has been proved only for the cases n < 5. Here, for a line ℓ we introduce and study the concept of ℓ-lowering of the set X and define so called proper lines. We also provide refinements of several basic properties of GC_n sets regarding the maximal lines, n-node lines, the used lines, as well as the subset of nodes that use a given line.

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
05/18/2018

Deterministic Distributed Ruling Sets of Line Graphs

An (α,β)-ruling set of a graph G=(V,E) is a set R⊆ V such that for any n...
research
01/30/2021

The Dimension Spectrum Conjecture for Planar Lines

Let L_a,b be a line in the Euclidean plane with slope a and intercept b....
research
04/14/2021

Harmonious Semantic Line Detection via Maximal Weight Clique Selection

A novel algorithm to detect an optimal set of semantic lines is proposed...
research
10/05/2017

Efficient Generation of Geographically Accurate Transit Maps

We present LOOM (Line-Ordering Optimized Maps), a fully automatic genera...
research
05/24/2020

Redundancy Analysis of the Railway Network of Hungary

Available alternative routes on which traffic can be rerouted in the cas...
research
05/28/2021

On plane algebraic curves passing through n-independent nodes

Let a set of nodes 𝒳 in the plane be n-independent, i.e., each node has ...

Please sign up or login with your details

Forgot password? Click here to reset