Metraipolis › archive › dc_9a293bdd045b

A counterexample to vertex interpolation by planar $C^1$ cubic splines — arXiv:2609.06364

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06364
License (as archived)
CC0-1.0
Archived
2026-10-16T14:47:56.636Z
SHA-256 of the archived text
c0d3084dab5c3e092ccf7539465a993541f108475311f174cb5fd9c2442a3843
Stable URL of this page
https://metraipolis.com/documento/dc_9a293bdd045b

How to cite

A counterexample to vertex interpolation by planar $C^1$ cubic splines — arXiv:2609.06364 — arXiv (en), https://arxiv.org/abs/2609.06364 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9a293bdd045b (Metraipolis archive dc_9a293bdd045b, sha256 c0d3084dab5c3e092ccf7539465a993541f108475311f174cb5fd9c2442a3843)
BibTeX
@misc{dc9a293bdd045b,
  title = {A counterexample to vertex interpolation by planar $C^1$ cubic splines — arXiv:2609.06364},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06364},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9a293bdd045b; sha256 c0d3084dab5c3e092ccf7539465a993541f108475311f174cb5fd9c2442a3843},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06364. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We construct a nondegenerate conforming straight-line triangulation of a polygonal disk on which some vertex data admit no continuously differentiable piecewise polynomial interpolant of total degree at most three. The triangulation has 41 vertices and 56 triangles, and the graph induced by its interior vertices is a tree with eight arms of length two. Every cubic $C^1$ spline on this triangulation satisfies an explicit linear relation with integer coefficients among its vertex values. We derive the relation by a weighted sum of Bernstein--Bézier smoothness equations and verify it using rational coordinates and weights. This disproves Alfeld's conjecture on vertex interpolation. The nonexistence proof does not require a matrix rank computation. A separate computation in exact arithmetic gives rank 40 for the vertex evaluation map and dimension 107 for the spline space, attaining the classical dimension lower bound for this triangulation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.06364 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:30:08.696Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).