相关论文: The Paulsen Problem Made Simple

A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm runs in $O((nm)^2 \log(nm))$ time [Mount,…

We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing…

We establish the small data solvability of suitable quasilinear wave and Klein-Gordon equations in high regularity spaces on a geometric class of spacetimes including asymptotically de Sitter spaces. We obtain our results by proving the…

In this work, we transform the equation in the upper half space first studied by Caffarelli and Silvestre to an equation in the Euclidean unit ball $\mathbb{B}^n$. We identify the Poisson kernel for the equation in the unit ball. Using the…

The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\mu : P \to \mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\tau : P \times…

Knapsack is one of the most fundamental problems in theoretical computer science. In the $(1 - \epsilon)$-approximation setting, although there is a fine-grained lower bound of $(n + 1 / \epsilon) ^ {2 - o(1)}$ based on the $(\min,…

We consider second order uniformly elliptic operators of divergence form in $\R^{d+1}$ whose coefficients are independent of one variable. For such a class of operators we establish a factorization into a product of first order operators…

A new approach to Poisson approximation is proposed. The basic idea is very simple and based on properties of the Charlier polynomials and the Parseval identity. Such an approach quickly leads to new effective bounds for several Poisson…

This paper presents a framework for computing the Gromov-Wasserstein problem between two sets of points in low dimensional spaces, where the discrepancy is the squared Euclidean norm. The Gromov-Wasserstein problem is a generalization of…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

In this paper, we provide a new means of establishing solvability of the Dirichlet problem on Lipschitz domains, with measurable data, for second order elliptic, non-symmetric divergence form operators. We show that a certain optimal…

Various particle filters have been proposed over the last couple of decades with the common feature that the update step is governed by a type of control law. This feature makes them an attractive alternative to traditional sequential Monte…

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…

We construct Parseval wavelet frames in $L^2(M)$ for a general Riemannian manifold $M$ and we show the existence of wavelet unconditional frames in $L^p(M)$ for $1 < p <\infty$. This is made possible thanks to smooth orthogonal projection…

Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for $n$ data points (each of dimension $d$) and a nonconvex sparsity penalty. We prove that finding an…

This paper solves the open problem of the simplicity of the second Dirichlet eigenvalue for nearly equilateral triangles, offering a complete solution to Conjecture 6.47 posed by R. Laugesen and B. Siudeja in A. Henrot's book ``Shape…

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{\gamma}(p,S)$ as the sum of…

The paper is concerned with the interconnection of the boundary behaviour of the solutions of the exterior Dirichlet and Neumann problems of harmonic analysis for the three-dimensional unit ball with the corresponding behaviour of the…

In a series of publications of the second author, including some with coauthors, globally strictly convex Tikhonov-like functionals were constructed for some nonlinear ill-posed problems. The main element of such a functional is the…

Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $(1+\varepsilon, \dots ,…