Polynomial interpolation in higher dimension: from simplicial complexes to GC sets
Authors:
- Nathan FieldsteelNFNathan Fieldsteel
- Hal SchenckHSHal Schenck
Preprint
Abstract
Geometrically characterized (GC) sets were introduced by Chung-Yao in their work on polynomial interpolation in R^d. Conjectures on the structure of GC sets have been proposed by Gasca-Maeztu for the planar case, and in higher dimension by de Boor and Apozyan-Hakopian. We investigate GC sets in dimension three or more, and show that one way to obtain such sets is from the combinatorics of simplicial complexes.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Graded Syzygies2011
- A new proof of the Gasca–Maeztu conjecture for n="4Journal of Approximation Theory, 2009
- Classification of sets satisfying the geometric characterizationNumerical Algorithms, 2008
- Multivariate polynomial interpolation: conjectures concerning GC-setsNumerical Algorithms, 2007
- Interpolation lattices in several variablesNumerische Mathematik, 2006
- SUBSPACE ARRANGEMENTS DEFINED BY PRODUCTS OF LINEAR FORMSJournal of the London Mathematical Society, 2005
- On the history of multivariate polynomial interpolationJournal of Computational and Applied Mathematics, 2000
- Minimal resolutions of some monomial idealsJournal of Algebra, 1990
- On Lagrange and Hermite interpolation in R kNumerische Mathematik, 1982
- Zur mechanischen KubaturMonatshefte für Mathematik, 1948