Related papers: Approximation by proper holomorphic maps and tropi…

We approximate the solution to some linear and degenerate quasi-linear problem involving a linear elliptic operator (like the semi-discrete in time implicit Euler approximation of Richards and Stefan equations) with measure right-hand side…

Hamiltonian normal forms allow for the analytical approximation of center manifold trajectories and their invariant manifolds through the separation of the saddle and center subspaces that make up the dynamics at the collinear libration…

We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…

We define and develop a homotopy invariant notion for the topological complexity of a map $f:X \to Y$, denoted TC($f$), that interacts with TC($X$) and TC($Y$) in the same way cat($f$) interacts with cat($X$) and cat($Y$). Furthermore,…

We study the local geometry of the pullback of a variety via a finite holomorphic map. In particular, we are looking for properties of $V = F^{-1}(W)$ such that if $V$ has the property $A$, then $W$ must have the property $A$. We show that…

This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized. The problem is well understood when we seek to minimize the Euclidean distance…

Because of the high approximation power and simplicity of computation of smooth radial basis functions (RBFs), in recent decades they have received much attention for function approximation. These RBFs contain a shape parameter that…

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\}$ or more generally $m$-dimensional vectors of such discrete values. We…

Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

Let $n\geq 2$. In this paper, we obtain approximation properties of various families of normalized univalent mappings $f$ on the Euclidean unit ball $\mathbb{B}^n$ in $\mathbb{C}^n$ by automorphisms of $\mathbb{C}^n$ whose restrictions to…

Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…

This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted…

Let $D$ be a disk in $\mathbb{R}^n$ and $f\in C^{r+2}(D, \mathbb{R}^k)$. We deal with the problem of the algebraic approximation of the set $j^{r}f^{-1}(W)$ consisting of the set of points in the disk $D$ where the $r$-th jet extension of…

We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

The Weighted Tree Augmentation Problem (WTAP) is a fundamental network design problem where the goal is to find a minimum-cost set of additional edges (links) to make an input tree 2-edge-connected. While a 2-approximation is standard and…

We explain how to tropicalize scalar quantum field theory and show that tropicalized massive scalar quantum field theory is exactly solvable. This exact solution manifests as a non-linear recursion equation fulfilled by the expansion…

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…