14 citations · 48 across the 28 of their papers we have counts for
5 papers · 1 filter
Chebyshev multivariate polynomial approximation and point reduction procedure
Nadezda Sukhorukova, Julien Ugon, David Yost
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on th…
A generalisation of de la Vallée-Poussin procedure to multivariate approximations
Nadezda Sukhorukova, Julien Ugon
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is,…
Polytopes close to being simple
Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that -polytopes with at most nonsimple vertices are reconstructib…
The excess degree of a polytope
Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
We define the excess degree of a -polytope as , where and denote the number of vertices and edges, respectively. This parameter measures how mu…
On the reconstruction of polytopes
Joseph Doolittle, Eran Nevo, Guillermo Pineda-Villavicencio +2
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its -skeleton. Call a vertex of a -polytope \emph{nonsim…