On the basic properties of GCn sets

Abstract: A planar node set

m a t h c a l X,

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 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

m a t h c a l X .

At most

n + 1

nodes can be collinear in any

G C_{n}

set and an

(n + 1)

-node line is called a 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

n l e 5.

Here, for a line

e l l

we introduce and study the concept of

e l l

-lowering of the set

m a t h c a l X

and define so called proper lines. We also provide refinements of several basic properties of

G C_{n}

sets regarding the maximal lines,

n

-node lines, the used lines, as well as the subset of nodes that use a given line.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: On the basic properties of GCn sets