The Gasca-Maeztu Conjecture for n = 4
Asian Research Journal of Mathematics · pp. 1–7 · Published 20 Feb 2019
10.9734/arjom/2019/v12i230083Abstract
We consider planar GCn node sets, i.e., n-poised sets whose all n-fundamental polynomials are products of n linear factors. Gasca and Maeztu conjectured in 1982 that every such set possesses a maximal line, i.e., a line passing through n + 1 nodes of the set. Till now the conjecture is confirmed to be true for n ≤ 5. The case n = 5 was proved recently by H. Hakopian, K. Jetter, and G. Zimmermann (Numer. Math. 127 (2014) 685{713). In this paper we bring a short and simple proof of the conjecture for n = 4.
Cited by 12
Hakop Hakopian, G. Vardanyan, N. Vardanyan · arXiv.org · 2025
H. Hakopian, G. Vardanyan, N. Vardanyan · arXiv.org · 2022
Ludovico Bruni Bruno, E. Zampa · ESAIM: Mathematical Modelling and Numerical Analysis · 2022
G. Vardanyan · Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences) · 2021
J. Carnicer, C. Godés, T. Sauer · 2020
H. Hakopian, N. Vardanyan · Journal of knot theory and its ramifications · 2020
H. Hakopian, D. Voskanyan · Journal of Contemporary Mathematical Analysis-armenian Academy of Sciences · 2019
J. Carnicer, C. Godés · Advances in Computational Mathematics · 2018
H. Hakopian, V. Vardanyan · Advances in Computational Mathematics · 2018
H. Hakopian, V. Vardanyan · Advances in Computational Mathematics · 2017
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
12
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.