English
Related papers

Related papers: The density of planar sets avoiding unit distances

200 papers

In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…

Combinatorics · Mathematics 2025-04-08 Gabriel Currier , József Solymosi

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Andras Szenes

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

Combinatorics · Mathematics 2025-02-14 Boris Alexeev , Dustin G. Mixon , Hans Parshall

The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…

Materials Science · Physics 2010-01-12 Jozsef Garai

Erd\H{o}s conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has…

Number Theory · Mathematics 2016-05-06 Mauro Di Nasso , Isaac Goldbring , Renling Jin , Steven Leth , Martino Lupini , Karl Mahlburg

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

Combinatorics · Mathematics 2015-09-21 János Barát , Géza Tóth

We consider the Grenander estimator that is the maximum likelihood estimator for non-increasing densities. We prove uniform central limit theorems for certain subclasses of bounded variation functions and for H\"older balls of smoothness…

Statistics Theory · Mathematics 2015-06-29 Jakob Söhl

The density bound for schedulability for general pinwheel instances is $\frac{5}{6}$, but density bounds better than $\frac{5}{6}$ can be shown for cases in which the minimum element $m$ of the instance is large. Several recent works have…

Data Structures and Algorithms · Computer Science 2025-08-27 Ahan Mishra , Parker Rho , Robert Kleinberg

This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that (i) the limiting relative frequencies of the numerical sequence are governed by an unknown density, and (ii) there is a known…

Probability · Mathematics 2008-06-19 Andrew B. Nobel , Gusztav Morvai , Sanjeev R. Kulkarni

In this paper, we study the inner and outer boundary densities of some sets with self-similar boundary having Minkowski dimension $s\textgreater{}d-1$ in $\mathbb{R}^{d}$. These quantities turn out to be crucial in some problems of set…

Probability · Mathematics 2016-08-07 Raphaël Lachièze-Rey , Sergio Vega

The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.

Number Theory · Mathematics 2019-02-27 Christian Elsholtz , Jan-Christoph Schlage-Puchta

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

General Mathematics · Mathematics 2007-12-20 Binhai Zhu

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

Combinatorics · Mathematics 2012-11-30 Ryan Schwartz

I derive a lower limit on the mass of an Unidentified Flying Object (UFO) based on measurements of its speed and acceleration, as well as the infrared luminosity of the airglow around it. If the object's radial velocity can be neglected,…

Popular Physics · Physics 2024-12-19 Abraham Loeb

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

Combinatorics · Mathematics 2021-12-16 Péter Ágoston , Dömötör Pálvölgyi

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

Classical Analysis and ODEs · Mathematics 2018-11-09 Pablo Shmerkin

Studies of transiting extra-solar planets are of key importance for understanding the nature of planets outside our Solar System, because their densities can be determined, constraining of what the planets are made of. Using the data…

Earth and Planetary Astrophysics · Physics 2019-08-19 Eike W. Guenther , CoRoT-Team