相关论文: The Paulsen Problem Made Simple

In this paper, linear $\varepsilon$-orthogonality preserving mappings are studied. We define $\hat{\varepsilon}\left(T\right) $ as the smallest $\varepsilon$ for which $T$ is $\varepsilon$-orthogonality preserving, and then derive an exact…

We characterize the solutions of the Poisson equation and the domain of its associated one-sided Hilbert transform for Ces\`aro bounded operators of fractional order. The results obtained fairly generalize the corresponding ones for…

The k-means problem consists of finding k centers in the d-dimensional Euclidean space that minimize the sum of the squared distances of all points in an input set P to their closest respective center. Awasthi et. al. recently showed that…

We prove an analogue of a perturbation result for the Dirichlet problem of divergence form elliptic operators by Fefferman, Kenig and Pipher, for the degenerate elliptic operators of David, Feneuil and Mayboroda, which were developed to…

We consider an obstacle problem in the Heisenberg group framework, and we prove that the operator on the obstacle bounds pointwise the operator on the solution. More explicitly, if $\epsilon\ge0$ and $\bar u_\epsilon$ minimizes the…

We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best known approximation bound for high dimensional Euclidean…

Given a set $P$ of $n$ points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plane and the distance…

We study a source identification problem for a prototypical elliptic PDE from Dirichlet boundary data. This problem is ill-posed, and the involved forward operator has a significant nullspace. Standard Tikhonov regularization yields…

The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with…

For Banach spaces $X,Y,$ we consider a distance problem in the space of bounded linear operators $\mathcal{L}(X,Y).$ Motivated by a recent paper \cite{RAO21}, we obtain sufficient conditions so that for a compact operator…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

In this work we extend consideration of the polynomial Carleson operator to the setting of a Radon transform acting along the paraboloid in $\mathbb{R}^{n+1}$ for $n \geq 2$. Inspired by work of Stein and Wainger on the original polynomial…

This paper is devoted to studying the stationary solutions of a general constrained optimization problem through its associated unconstrained penalized problems. We aim to answer the question, "what do the stationary solutions of a…

We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…

We study the inverse problem of determining the coefficients of the fractional power of a general second order elliptic operator given in the exterior of an open subset of the Euclidean space. We show the problem can be reduced into…

The ball-constrained weighted maximin dispersion problem $(\rm P_{ball})$ is to find a point in an $n$-dimensional Euclidean ball such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We propose a new…

This is a survey, which is a continuation of the previous survey of the author about applications of Carleman estimates to Inverse Problems, J. Inverse and Ill-Posed Problems, 21, 477-560, 2013. It is shown here that Tikhonov functionals…

Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…

We establish Dahlberg's perturbation theorem for non-divergence form operators L = A\nabla^2. If L_0 and L_1 are two operators on a Lipschitz domain such that the L^p Dirichlet problem for the operator L_0 is solvable for some p in…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…