English
Related papers

Related papers: Several Conclusions on another site setting proble…

200 papers

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

Data Structures and Algorithms · Computer Science 2016-05-24 Zhewei Wei , Ke Yi

We consider Laplacian eigenfunctions on a $d-$dimensional bounded domain $M$ (or a $d-$dimensional compact manifold $M$) with Dirichlet conditions. These operators give rise to a sequence of eigenfunctions $(e_\ell)_{\ell \in \mathbb{N}}$.…

Analysis of PDEs · Mathematics 2018-11-27 Jianfeng Lu , Christopher D. Sogge , Stefan Steinerberger

Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…

Combinatorics · Mathematics 2024-12-20 József Balogh , Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

Results on unconditional convergence in the Maximum norm for ADI-type methods, such as the Douglas method, applied to the time integration of semilinear parabolic problems are quite difficult to get, mainly when the number of space…

Numerical Analysis · Mathematics 2021-02-25 S. Gonzalez Pinto , D. Hernandez Abreu

Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…

Computational Geometry · Computer Science 2026-01-29 Prosenjit Bose , Guillermo Esteban , Tyler Tuttle

Consider a compact $M \subset \mathbb{R}^d$ and $l > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the length (one-dimensional Hausdorff measure $\mathcal H$) at most $l$ that minimizes \[ \max_{y…

Metric Geometry · Mathematics 2025-02-04 Danila Cherkashin , Yana Teplitskaya

We give a dimensionality reduction procedure to approximate the sum of distances of a given set of $n$ points in $R^d$ to any "shape" that lies in a $k$-dimensional subspace. Here, by "shape" we mean any set of points in $R^d$. Our…

Data Structures and Algorithms · Computer Science 2021-06-25 Zhili Feng , Praneeth Kacham , David P. Woodruff

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

Combinatorics · Mathematics 2022-02-14 A. Gafni , A. Iosevich , E. Wyman

Let $\{A_n\}_{n=1}^{\infty}$ be a sequence of events on a probability space $(\Omega,\mathcal{F},\mathbf{P})$. We show that if $\lim_{m\to\infty}\sum_{n=1}^{m}w_n\mathbf{P}(A_n)=\infty$ where each $w_n\in\mathbb{R}$, then…

Probability · Mathematics 2009-10-02 Chunrong Feng , Liangpan Li , Jian Shen

We prove that, for every fixed $\theta_0>0$, selecting a subset of prescribed cardinality that maximizes the Solow--Polasky diversity indicator is NP-hard for finite point sets in $\mathbb{R}^2$ with the Euclidean metric, and therefore also…

Computational Geometry · Computer Science 2026-04-22 Michael T. M. Emmerich , Ksenia Pereverdieva , André H. Deutz

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

Combinatorics · Mathematics 2024-02-02 Simone Costa , Stefano Della Fiore , Andrea Ferraguti

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

Metric Geometry · Mathematics 2014-06-26 Mark Herman , Jonathan Pakianathan

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $\Delta(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the…

Combinatorics · Mathematics 2026-05-28 Daewoong Cheong , Gennian Ge , Doowon Koh , Thang Pham , Dung The Tran , Tao Zhang

We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval…

Disordered Systems and Neural Networks · Physics 2017-10-11 Sergio Caracciolo , Matteo D'Achille , Gabriele Sicuro

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi

We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, i.e. of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…

Metric Geometry · Mathematics 2023-10-27 Alexey Gordeev , Yana Teplitskaya

Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…

General Mathematics · Mathematics 2017-01-04 Mitrofan M. Choban , Vasile Berinde

If $\Sigma$ and $\Sigma'$ are homotopic embedded surfaces in a $4$-manifold then they may be related by a regular homotopy (at the expense of introducing double points) or by a sequence of stabilisations and destabilisations (at the expense…

Geometric Topology · Mathematics 2020-05-13 Oliver Singh

The ``analyst's traveling salesman theorem'' of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This result, proven for the plane by Jones (1990) and extended to…

Computational Complexity · Computer Science 2007-05-23 Xiaoyang Gu , Jack H. Lutz , Elvira Mayordomo