相关论文: The Paulsen Problem Made Simple

We prove limit theorems for functionals of a Poisson point process using the Malliavin calculus on the Poisson space. The target distribution is conditionally either a Gaussian vector or a Poisson random variable. The convergence is stable…

We present a way to construct Parseval frames of piecewise constant functions for $L^2[0,1]$. The construction is similar to the generalized Walsh bases. It is based on iteration of operators that satisfy a Cuntz-type relation, but without…

Peccati, Sole, Taqqu, and Utzet recently combined Stein's method and Malliavin calculus to obtain a bound for the Wasserstein distance of a Poisson functional and a Gaussian random variable. Convergence in the Wasserstein distance always…

We show small and large Carleson perturbation results for the parabolic Regularity boundary value problem with boundary data in $\dot{L}_{1,1/2}^p$ and small Carelson perturbation results for the Neumann problem with boundary data in $L^p$.…

We study the problem of $k$-means clustering in the space of straight-line segments in $\mathbb{R}^{2}$ under the Hausdorff distance. For this problem, we give a $(1+\epsilon)$-approximation algorithm that, for an input of $n$ segments, for…

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…

We consider the Dirichlet problem on general, possibly nonsmooth bounded domain, for elliptic linear equation with uniformly elliptic divergence form operator. We investigate carefully the relationship between weak, soft and the…

This article addresses a fundamental concern regarding the incompressible approximation of fluid motions, one of the most widely used approximations in fluid mechanics. Common belief is that its accuracy is $O(\epsilon)$ where $\epsilon$…

In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the…

We present Epsilon, a system for general convex programming using fast linear and proximal operators. As with existing convex programming frameworks, users specify convex optimization problems using a natural grammar for mathematical…

We study the traveling salesman problem in the hyperbolic plane of Gaussian curvature $-1$. Let $\alpha$ denote the minimum distance between any two input points. Using a new separator theorem and a new rerouting argument, we give an…

The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…

The Johnson-Lindenstrauss (JL) Lemma introduced the concept of dimension reduction via a random linear map, which has become a fundamental technique in many computational settings. For a set of $n$ points in $\mathbb{R}^d$ and any fixed…

The Traveling Salesman Problem (TSP) in the $d$-dimensional Euclidean space is among the oldest and most famous NP-hard optimization problems. In breakthrough works, Arora [J. ACM 1998] and Mitchell [SICOMP 1999] gave the first polynomial…

A well-studied continuous model of graphs, introduced by Dearing and Francis [Transportation Science, 1974], considers each edge as a continuous unit-length interval of points. For $\delta \geq 0$, we introduce the problem $\delta$-Tour,…

We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $\lambda : R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } \lambda(r) = \sum_{b \in B} \lambda(b)$ be demand functions over…

In this work, we revisit the study by M. E. Schonbek [11] concerning the problem of existence of global entropic weak solutions for the classical Boussinesq system, as well as the study of the regularity of these solutions by C. J. Amick…