Related papers: The Paulsen Problem Made Simple

We prove that a variety of oscillatory and polynomial Carleson operators are uniformly bounded on the family of parameters under considerations. As a particular application of our techniques, we prove uniform bounds for oscillatory Carleson…

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

We prove the existence and uniqueness of solution of the obstacle problem for quasilinear stochastic partial differential equations (OSPDEs for short) with Neumann boundary condition. Our method is based on the analytical technics coming…

We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…

In this paper, we consider the extensively studied problem of computing a $k$-sparse approximation to the $d$-dimensional Fourier transform of a length $n$ signal. Our algorithm uses $O(k \log k \log n)$ samples, is dimension-free, operates…

We prove an existence and uniqueness result for quasilinear Stochastic PDEs with obstacle (OSPDE in short). Our method is based on analytical technics coming from the parabolic potential theory. The solution is expressed as a pair $(u,\nu)$…

We consider approximations of signals by the elements of a frame in a complex vector space of dimension $N$ and formulate both the noiseless and the noisy sparse representation problems. The noiseless representation problem is to find…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

In this paper, we study the Poisson problem involving a fractional Hardy operator and a measure source. The complex interplay between the nonlocal nature of the operator, the peculiar effect of the singular potential and the measure source…

In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin…

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

We study the relationship between the Dirichlet and Regularity problem for parabolic operators of the form $ L = \mbox{div}(A\nabla\cdot) - \partial_t $ on cylindrical domains $ \Omega = \mathcal O \times \mathbb R $, where the base $…

The central force problem is considered in a three dimensional space in which the Poisson bracket among the spatial coordinates is the one by the SU(2) Lie algebra. It is shown that among attractive power-law potentials it is only the…

In this article we prove the existence of the Born approximation in the context of the radial Calder\'on problem for Schr\"odinger operators. The Born approximation naturally appears as the linear component of a factorization of the…

Lawson's iteration is a classical and effective method for solving the linear (polynomial) minimax approximation problem in the complex plane. Extension of Lawson's iteration for the rational minimax approximation problem with both…

Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…

Let $\Omega$ be a Lipschitz domain in $\mathbb R^n$ $n\geq 2,$ and $L=\mbox{div} (A\nabla\cdot)$ be a second order elliptic operator in divergence form. We establish solvability of the Dirichlet regularity problem with boundary data in…

In this paper we prove the existence of a solution to the Dirichlet problem for harmonic maps into a geodesic ball on which the squared distance function from the origin is strictly convex. This improves a celebrated theorem obtained by S.…

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…