Related papers: The Paulsen Problem Made Simple

The quest for an algorithm that solves an $n\times n$ linear system in $O(n^2)$ time complexity, or $O(n^2 \text{poly}(1/\epsilon))$ when solving up to $\epsilon$ relative error, is a long-standing open problem in numerical linear algebra…

We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…

We prove that the size of the sparsest directed k-spanner of a graph can be approximated in polynomial time to within a factor of $\tilde{O}(\sqrt{n})$, for all k >= 3. This improves the $\tilde{O}(n^{2/3})$-approximation recently shown by…

The computation of (i) $\varepsilon$-kernels, (ii) approximate diameter, and (iii) approximate bichromatic closest pair are fundamental problems in geometric approximation. In this paper, we describe new algorithms that offer significant…

We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\mathbb{R}^d$, for $d\geq 3$) or…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

Based on the two decades old celebrated Paulsen problem and its solutions for Hilbert spaces by Kwok, Lau, Lee, Ramachandran, Hamilton, and Moitra, we formulate Paulsen problem for Banach spaces. We also formulate projection problem for…

Let (P) denote the problem of existence of a point in the plane of a given triangle T, that is at rational distance from all the vertices of T. In this article, we provide a complete solution to (P) for all equilateral triangles.

A plasmon of a bounded domain $\Omega\subset\mathbb{R}^n$ is a non-trivial bounded harmonic function on $\mathbb{R}^n\setminus\partial\Omega$ which is continuous at $\partial\Omega$ and whose exterior and interior normal derivatives at…

Given a point set $P$ in the plane, we seek a subset $Q\subseteq P$, whose convex hull gives a smaller and thus simpler representation of the convex hull of $P$. Specifically, let $cost(Q,P)$ denote the Hausdorff distance between the convex…

In this paper, we continue the study of a class of second order elliptic operators of the form $\mathcal L=\mbox{div}(A\nabla\cdot)$ in a domain above a Lipschitz graph in $\mathbb R^n,$ where the coefficients of the matrix $A$ satisfy a…

A partition $\mathcal{P}$ of $\mathbb{R}^d$ is called a $(k,\varepsilon)$-secluded partition if, for every $\vec{p} \in \mathbb{R}^d$, the ball $\overline{B}_{\infty}(\varepsilon, \vec{p})$ intersects at most $k$ members of $\mathcal{P}$. A…

Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$. We…

Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing…

The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a…

We consider the Schur-Horn problem for normal operators in von Neumann algebras, which is the problem of characterizing the possible diagonal values of a given normal operator based on its spectral data. For normal matrices, this problem is…

In the paper arXiv:1708.02289 we have introduced new solvability methods for strongly elliptic second order systems in divergence form on a domains above a Lipschitz graph, satisfying $L^p$-boundary data for $p$ near $2$. The main novel…

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We…