Related papers: The Paulsen Problem Made Simple

The Dirichlet problem on a bounded planar domain is more readily understood and solved for the Laplace operator than it is for a Schrodinger operator. When the potential function is small, we might hope to approximate the solution to the…

We consider parabolic operators of the form $$\partial_t+\mathcal{L},\ \mathcal{L}:=-\mbox{div}\, A(X,t)\nabla,$$ in $\mathbb R_+^{n+2}:=\{(X,t)=(x,x_{n+1},t)\in \mathbb R^{n}\times \mathbb R\times \mathbb R:\ x_{n+1}>0\}$, $n\geq 1$. We…

We prove existence of solutions to boundary value problems and obstacle problems for degenerate-elliptic, linear, second-order partial differential operators with partial Dirichlet boundary conditions using a new version of the Perron…

In this work we study convergence properties of sparse polynomial approximations for a class of affine parametric saddle point problems. Such problems can be found in many computational science and engineering fields, including the Stokes…

We are interested in the classical ill-posed Cauchy problem for the Laplace equation. One method to approximate the solution associated with compatible data consists in considering a family of regularized well-posed problems depending on a…

We study vertex sparsification for distances, in the setting of planar graphs with distortion: Given a planar graph $G$ (with edge weights) and a subset of $k$ terminal vertices, the goal is to construct an $\varepsilon$-emulator, which is…

In this paper, we fully resolve the question of whether the Regularity problem for the parabolic PDE $\partial_tu - \mbox{div}(A\nabla u)=0$ on the domain $\mathbb R^{n+1}_+\times\mathbb R$ is solvable for some $p\in (1,\infty)$ under the…

Let $\varepsilon>0$ be a small parameter. We consider the domain $\Omega_\varepsilon:=\Omega\setminus D_\varepsilon$, where $\Omega$ is an open domain in $\mathbb{R}^n$, and $D_\varepsilon$ is a family of small balls of the radius…

We establish some new $L^p$-improving bounds for the $k$-simplex averaging operators $S^k$ that hold in dimensions $d \geq k$. As a consequence of these $L^p$-improving bounds we obtain nontrivial bounds $S^k\colon L^{p_1}\times\cdots\times…

Consider n=2l>=4 point particles with equal masses in space, subject to the following symmetry constraint: at each instant they form an orbit of the dihedral group D_l, where D_l is the group of order 2l generated by two rotations of angle…

In this paper we consider nonlinear problems with an operator depending only on the deformation tensor. We consider the class of operators derived from a potential and with $(p,\delta)$ structure, for $1<p\leq 2$ and for all $\delta\geq0$.…

We study the local statistics of orthogonal polynomial ensembles near a hard edge, subject to a multiplicative deformation of the measure. Probabilistically, this deformation corresponds to a position-dependent conditional thinning of the…

$\renewcommand{\Re}{\mathbb{R}}\newcommand{\eps}{{\varepsilon}}\newcommand{\poly}{\mathrm{poly}} $In this paper, we study the problem of $L_1$-fitting a shape to a set of $n$ points in $\Re^d$ (where $d$ is a fixed constant), where the…

The (non-uniform) sparsest cut problem is the following graph-partitioning problem: given a "supply" graph, and demands on pairs of vertices, delete some subset of supply edges to minimize the ratio of the supply edges cut to the total…

The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning…

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor.…

A well-studied continuous model of graphs considers each edge as a continuous unit-length interval of points. In the problem $\delta$-Tour defined within this model, the objective to find a shortest tour that comes within a distance of…