English
Related papers

Related papers: The Paulsen Problem Made Simple

200 papers

We prove the $W^{1,2}_p$-estimate and solvability for the Dirichlet problem of second-order parabolic equations in simple convex polytopes with time irregular coefficients, when $p\in (1,2]$. We also consider the corresponding Neumann…

Analysis of PDEs · Mathematics 2014-07-28 Hongjie Dong , Doyoon Kim

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

Computational Geometry · Computer Science 2019-03-19 Timothy M. Chan , Sariel Har-Peled

For a parabolic equation associated to a uniformly elliptic operator, we obtain a $W^{3, \varepsilon}$ estimate, which provides a lower bound on the Lebesgue measure of the set on which a viscosity solution has a quadratic expansion. The…

Analysis of PDEs · Mathematics 2014-10-09 Jean-Paul Daniel

We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour that visits each line. The best known upper and lower bounds…

Data Structures and Algorithms · Computer Science 2024-04-23 Antonios Antoniadis , Sándor Kisfaludi-Bak , Bundit Laekhanukit , Daniel Vaz

We propose a new algorithm that finds an $\varepsilon$-approximate fixed point of a smooth function from the $n$-dimensional $\ell_2$ unit ball to itself. We use the general framework of finding approximate solutions to a variational…

Computer Science and Game Theory · Computer Science 2025-01-22 Idan Attias , Yuval Dagan , Constantinos Daskalakis , Rui Yao , Manolis Zampetakis

We revisit the notion of WSPD (i.e., well-separated pairs-decomposition), presenting a new construction of WSPD for any finite metric space, and show that it is asymptotically instance-optimal in size. Next, we describe a new WSPD…

Computational Geometry · Computer Science 2025-09-09 Sariel Har-Peled , Benjamin Raichel , Eliot W. Robson

In the pairwise weighted spanner problem, the input consists of an $n$-vertex-directed graph, where each edge is assigned a cost and a length. Given $k$ vertex pairs and a distance constraint for each pair, the goal is to find a…

Data Structures and Algorithms · Computer Science 2023-07-10 Elena Grigorescu , Nithish Kumar , Young-San Lin

We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…

Number Theory · Mathematics 2018-02-14 Alessandro Gambini , Alessandro Languasco , Alessandro Zaccagnini

Motivated by the Poisson equation for the fractional Laplacian on the whole space with radial right hand side, we study global H\"older and Schauder estimates for a fractional Bessel equation. Our methods stand on the so-called semigroup…

Analysis of PDEs · Mathematics 2023-10-25 J. J. Betancor , A. J. Castro , P. R. Stinga

As a formal approximation, the nonlinear Schr\"{o}dinger (NLS) equation can be derived to describe the evolution of the envelopes of small oscillating wave packets-like solutions to the Euler-Poisson system. In this paper we rigorously…

Analysis of PDEs · Mathematics 2025-12-09 Huimin Liu , Xueke Pu

Given a simple polygon $\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\mathcal{P}$. The Point Guard Art Gallery problem asks for…

Computational Geometry · Computer Science 2016-07-20 Édouard Bonnet , Tillmann Miltzow

We prove affirmatively the one dimensional case of a conjecture of Stein regarding the $L^p$-boundedness of the Polynomial Carleson operator, for $1<p<\infty$. The proof is based on two new ideas: i) developing a framework for…

Classical Analysis and ODEs · Mathematics 2019-02-12 Victor Lie

We prove that the solvability of the regularity problem in $L^q(\partial \Omega)$ is stable under Carleson perturbations. If the perturbation is small, then the solvability is preserved in the same $L^q$, and if the perturbation is large,…

Analysis of PDEs · Mathematics 2022-08-02 Zanbing Dai , Joseph Feneuil , Svitlana Mayboroda

The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence of the text such that consecutive…

Data Structures and Algorithms · Computer Science 2020-02-18 Mitsuru Funakoshi , Yuto Nakashima , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda , Ayumi Shinohara

We discuss some regularity issues in the study of the obstacle problem. In particular, we present a recent result by O. Savin and the author on the regularity of the singular set for the obstacle problem with a fully nonlinear elliptic…

Analysis of PDEs · Mathematics 2019-10-22 Hui Yu

In this paper we revisit the classical Cauchy problem for Laplace's equation as well as two further related problems in the light of regularisation of this highly ill-conditioned problem by replacing integer derivatives with fractional…

Numerical Analysis · Mathematics 2023-09-26 Barbara Kaltenbacher an William Rundell

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

A basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a self-adjoint compact operator. In this paper, we prove upper bounds for the subspace distance, taylored for structured random…

Probability · Mathematics 2018-12-18 Moritz Jirak , Martin Wahl

We take an open regular domain $\Omega$ in $\mathbb{R}^n$ with $n\ge 3$. We introduce a pair of positive parameters $\epsilon_1$ and $\epsilon_2$ and we set $\epsilon\equiv(\epsilon_1,\epsilon_2)$. Then we define the perforated domain…

Analysis of PDEs · Mathematics 2017-09-20 Virginie Bonnaillie-Noël , Matteo Dalla Riva , Marc Dambrine , Paolo Musolino

We consider the following oblivious sketching problem: given $\epsilon \in (0,1/3)$ and $n \geq d/\epsilon^2$, design a distribution $\mathcal{D}$ over $\mathbb{R}^{k \times nd}$ and a function $f: \mathbb{R}^k \times \mathbb{R}^{nd}…

Data Structures and Algorithms · Computer Science 2022-02-22 Yi Li , David P. Woodruff