Some problems in polynomial interpolation and topological complexity

Approximation theory;Polynomial interpolation;Motion planning

Fieldsteel, Nathan Mulvey

关键词: Approximation theory;    Polynomial interpolation;    Motion planning;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/97758/FIELDSTEEL-DISSERTATION-2017.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

This thesis is comprised of two projects in applied computational mathematics. In Chapter 1, we discuss the geometry and combinatorics of geometrically characterized sets. These are finite sets ofn+d choose n points in R^d which impose independent conditions on polynomials of degree n, and which have Lagrange polynomials of a special form. These sets were introduced by Chung and Yao in a 1977 paper in the SIAM Journal of Numerical Analysis in the context of polynomial interpolation. There are several conjectures on the nature and geometric structure of these sets. We investigate the geometry and combinatorics of GC sets for d at least 2, and prove they are closely related to simplicial complexes which are Cohen-Macaulay and have a Cohen-Macaulay dual.In Chapter 2, we will discuss the motion planning problem in complex hyperplane arrangement complements. The difficulty of constructing a minimally discontinuous motion planning algorithm for a topological space X is measured by an integer invariant of X called topological complexity or TC(X). Yuzvinsky developed a combinatorial criterion for hyperplane arrangement complements which guarantees that their topological complexity is as large as possible. Applying this criterion in the special case when the arrangement is graphic, we simplify the criterion to an inequality on the edge density of the graph which is closely related to the inequality in the arboricity theorem of Nash-Williams.