Related papers: Approximation by proper holomorphic maps and tropi…
Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…
We consider convergence sets of formal power series of the form $f(z,t)=\sum_{n=0}^{\infty} f_n(z)t^n$, where $f_n(z)$ are holomorphic functions on a domain $\Omega$ in $\mathbb{C}$. A subset $E$ of $\Omega$ is said to be a convergence set…
In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region \Omega, within the complex plane. More precisely, we consider three types of regions and their intersections:…
We study the approximation of maps into complex manifolds along with interpolation on certain compact subsets of the plane. Results are also obtained regarding approximation and interpolation of sections of holomorphic submersions.
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
We study those smooth complex hypersurfaces W in C^n having the property that all holomorphic functions of finite weighted L^p norm on W extend to entire functions with finite weighted L^p norm. Such hypersurfaces are called interpolation…
We survey the main results of approximation theory for adaptive piecewise polynomial functions. In such methods, the partition on which the piecewise polynomial approximation is defined is not fixed in advance, but adapted to the given…
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings of maximal weight converge locally to a matching on the…
The idealized theory of quantum vacuum energy density is a beautiful application of the spectral theory of differential operators with boundary conditions, but its conclusions are physically unacceptable. A more plausible model of a…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
Let $G$ be a matrix group. Topological $G$-manifolds with Palais-proper action have the $G$-homotopy type of countable $G$-CW complexes (3.2). This generalizes E Elfving's dissertation theorem for locally linear $G$-manifolds (1996). Also…
Let $f$ be a holomorphic function on the strip $\{z\in C: -\alpha<Im z<\alpha\}, \alpha > 0$, belonging to the class $H(\alpha,-\alpha;\epsilon)$ defined below. It is shown that there exist holomorphic functions $w_1$ on $\{z\in C: 0<Im z…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
Experimental extraction of $\beta$-shape functions, C(W), is challenging. Comparing different experimental $\beta$-shapes to each other and to those predicted by theory in a consistent manner is difficult. This difficulty is compounded when…
We improve the running times of $O(1)$-approximation algorithms for the set cover problem in geometric settings, specifically, covering points by disks in the plane, or covering points by halfspaces in three dimensions. In the unweighted…
The ellipsoidal superpotential of the complex projective plane can be interpreted as a count of rigid rational plane curves of a given degree with one prescribed cusp singularity. In this note we present a closed formula for these counts as…
We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes…
Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…
Given an edge-weighted (metric/general) complete graph with $n$ vertices, the maximum weight (metric/general) $k$-cycle/path packing problem is to find a set of $\frac{n}{k}$ vertex-disjoint $k$-cycles/paths such that the total weight is…