相关论文: A new proof of the Gasca-Maeztu conjecture for n =…

An $n$-poised node set $\mathcal X$ in the plane is called $GC_n$ set if the (bivariate) fundamental polynomial of each node is a product of n linear factors. A line is called $k$-node line if it passes through exactly $k$-nodes of…

In this paper we consider n-poised planar node sets, as well as more special ones, called $GC_n$-sets. For these sets all $n$-fundamental polynomials are products of n linear factors as it always takes place in the univariate case. A line…

A planar node set $\mathcal X,$ with $|\mathcal X|=\binom{n+2}{2}$ 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 $Ax+By+C=0$ if $Ax+By+C$…

A two-dimensional $n$-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most ~$n$. We are interested in correct sets with the property that all fundamental polynomials are products of…

A planar node set $\mathcal X,$ with $\#\mathcal X=\binom{n+2}{2},$ 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…

The Gasca-Maeztu conjecture for the case $n=4$ was proved for the first time in [J. R. Busch, A note on Lagrange interpolation in $\mathbb{R}^2$, Rev. Un. Mat. Argentina, 36 (1990) 33--38]. Here we bring a short and simple proof of it.

An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can…

Let a set of nodes $\mathcal X$ in plain be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Suppose also that $|\mathcal X|= d(n,k-2)+2,$ where $d(n,k-2) = (n+1)+n+\cdots+(n-k+4)$ and $\ k\le n-1.$ In this paper…

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36…

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…

In 1962 P\'osa conjectured that every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of P\'osa's Conjecture. They also proved that it…

Let $[n]=X_1\cup X_2\cup X_3$ be a partition with $\lfloor\frac{n}{3}\rfloor \leq |X_i|\leq \lceil\frac{n}{3}\rceil$ and define $\mathcal{G}=\{G\subset [n]\colon |G\cap X_i|\leq 1, 1\leq i\leq 3\}$. It is easy to check that the trace…

In the year 1982, John Chollet conjectured that, for any pair of $n\times n$ positive semidefinite matrices $A,B$, $per(A)\cdot per(B)\geq per(A\circ B)$, where $A\circ B$ is the Hardamard product of $A$ and $B$. This conjecture was proved…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

An $(n,k)$-perfect sequence covering array with multiplicity $\lambda$, denoted PSCA$(n,k,\lambda)$, is a multiset whose elements are permutations of the sequence $(1,2, \dots, n)$ and which collectively contain each ordered length $k$…

In 2023, Gullerud, Johnson, and Mbirika presented results on their study of certain tridiagonal real symmetric matrices. As part of their work, they studied the roots to nonhomogeneous equations related to characteristic polynomials of…

Let K be a field of characteristic 0. We consider linear equations a1*x1+...+an*xn=1 in unknowns x1,...,xn from G, where a1,...,an are non-zero elements of K, and where G is a subgroup of the multiplicative group of non-zero elements of K.…

In 1950 G. Giuga studied the congruence $\sum_{j=1}^{n-1} j^{n-1} \equiv -1$ (mod $n$) and conjectured that it was only satisfied by prime numbers. In this work we generalize Giuga's ideas considering, for each $k \in \mathbb{N}$, the…

The Caccetta-Haggkvist conjecture states that if G is a finite directed graph with at least n/k edges going out of each vertex, then G contains a directed cycle of length at most k. Hamidoune used methods and results from additive number…

Let $n>3$ be a natural number. By a 1975 result of H. Strietz, the lattice Part$(n)$ of all partitions of an $n$-element set has a four-element generating set. In 1983, L. Z\'adori gave a new proof of this fact with a particularly elegant…