English
Related papers

Related papers: Distinct distance estimates and low degree polynom…

200 papers

We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…

Algebraic Geometry · Mathematics 2019-09-17 Takuro Abe , Alexandru Dimca , Gabriel Sticlaru

In this paper we study sets of points in the plane with rational distances from r prescribed points P_1, ...,P_r. A crucial case arises for r = 3, where we provide simple necessary and sufficient conditions for the density of this set in…

Number Theory · Mathematics 2025-06-24 Pietro Corvaja , Amos Turchet , Umberto Zannier

We study the property of uniform discreteness within discrete orbits of non-uniform lattices in $SL_2(\mathbb{R})$, acting on $\mathbb{R}^2$ by linear transformations. We provide quantitative consequences of previous results by using…

Number Theory · Mathematics 2025-11-26 Sahar Bashan

We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…

Computational Geometry · Computer Science 2009-09-30 Christian Knauer , Maarten Löffler , Marc Scherfenberg , Thomas Wolle

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…

Computational Geometry · Computer Science 2022-02-16 Ovidiu Daescu , Ka Yaw Teo

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…

Metric Geometry · Mathematics 2014-04-08 Marcos Charalambides

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

Combinatorics · Mathematics 2024-05-14 Eyvindur A. Palsson , Edward Yu

We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-matching setup, each point in the smaller set is matched to a…

Computational Geometry · Computer Science 2014-11-27 Rinat Ben-Avraham , Matthias Henze , Rafel Jaume , Balázs Keszegh , Orit E. Raz , Micha Sharir , Igor Tubis

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

General Mathematics · Mathematics 2026-05-27 Steven Senger

Good a-priori bounds on the smallest pairwise distance $r_{\rm{{min}}}(\mbox{LJ}_N^{\rm{gmin}})$ for a three-dimensional (3D) Lennard-Jones $N$-body cluster of globally minimal energy can significantly reduce the computational search space…

Atomic and Molecular Clusters · Physics 2025-11-20 Michael K. -H. Kiessling , David J. Wales

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

Classical Analysis and ODEs · Mathematics 2014-08-12 Tuomas Orponen

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

Metric Geometry · Mathematics 2008-02-03 János Pach , Joel Spencer

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

Combinatorics · Mathematics 2025-05-13 Sean Dewar , Nora Frankl , Samuel Mansfield , Anthony Nixon , Jonathan Passant , Audie Warren

We introduce a reduction from the distinct distances problem in ${\mathbb R}^d$ to an incidence problem with $(d-1)$-flats in ${\mathbb R}^{2d-1}$. Deriving the conjectured bound for this incidence problem (the bound predicted by the…

Combinatorics · Mathematics 2019-04-09 Sam Bardwell-Evans , Adam Sheffer

We prove that in every metric space where no line contains all the points, there are at least $\Omega(n^{2/3})$ lines. This improves the previous $\Omega(\sqrt{n})$ lower bound on the number of lines in general metric space, and also…

Combinatorics · Mathematics 2024-12-10 Congkai Huang

We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…

Classical Analysis and ODEs · Mathematics 2015-07-28 Jean Bourgain , Ciprian Demeter

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…

Combinatorics · Mathematics 2013-12-17 J. Solymosi , Cs. D. Toth

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov
‹ Prev 1 3 4 5 6 7 10 Next ›