Related papers: Simplicial approximation and complexity growth
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
We define the notion of an approximate triangulation for a manifold $M$ embedded in euclidean space. The basic idea is to build a nested family of simplicial complexes whose vertices lie in $M$ and use persistent homology to find a complex…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We provide a comprehensive study of interrelations between different measures of smoothness of functions on various domains and smoothness properties of approximation processes. Two general approaches to this problem have been developed:…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
The purpose of this paper is to study holomorphic approximation and approximation of $\bar\partial$-closed forms in complex manifolds of complex dimension $n\geq 1$. We consider extensions of the classical Runge theorem and the Mergelyan…
The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…
We consider the simplicial de Rham complex and the \v{C}ech-de Rham complex, two bigraded Hilbert complexes whose Hodge-Laplace problems govern spatially coupled problems in mixed dimension and homogeneous dimension, respectively. The…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…