English
Related papers

Related papers: The density of planar sets avoiding unit distances

200 papers

In the early 1990s, A. Bezdek and W. Kuperberg used a relatively simple argument to show a surprising result: The maximum packing density of circular cylinders of infinite length in $\mathbb{R}^3$ is exactly $\pi/\sqrt{12}$, the planar…

Metric Geometry · Mathematics 2017-09-14 Wöden Kusner

We report 60 and 90 micron observations of 7 millisecond pulsars with ISO. The pulsar PSR B1257+12 is orbited by three planets, and other millisecond pulsars may be orbited by dust disks that represent planets that failed to form or their…

Astrophysics · Physics 2015-06-24 Joseph Lazio , J. Fischer

The conditions that a planet must fulfill to be habitable are not precisely known. However, it is comparatively easier to define conditions under which a planet is very likely not habitable. Finding such conditions is important as it can…

Earth and Planetary Astrophysics · Physics 2015-06-17 Yann Alibert

We consider a particle diffusing outside a compact planar set and investigate its boundary local time $\ell_t$, i.e., the rescaled number of encounters between the particle and the boundary up to time $t$. In the case of a disk, this is…

Statistical Mechanics · Physics 2020-12-30 Denis S. Grebenkov

We find explicit and optimal upper bounds for the expected occupation density for an It\^o-process when its drift and diffusion coefficients are unknown under boundedness and ellipticity conditions on the coefficients. This is related to…

Probability · Mathematics 2023-10-20 Paul Krühner , Shijie Xu

We give a complete description of sampling and interpolation in the Bargmann-Fock space, based on a density concept of Beurling. Roughly speaking, a discrete set is a set of sampling if and only if its density in every part of the plane is…

Complex Variables · Mathematics 2016-09-06 Kristian Seip

Given an irreducible variety $X$ over a finite field, the density of hypersurfaces of varying degree $d$ intersecting $X$ in an irreducible subvariety is $1$, by a result of Charles and Poonen. In this note, we analyse the situation fixing…

Algebraic Geometry · Mathematics 2020-02-11 Mehdi Makhul , Josef Schicho

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

We present a sharp extension of a result of Bourgain on finding configurations of $k+1$ points in general position in measurable subset of $\mathbb{R}^d$ of positive upper density whenever $d\geq k+1$ to all proper $k$-degenerate distance…

Classical Analysis and ODEs · Mathematics 2020-04-22 Neil Lyall , Akos Magyar

In a series of recent preprints, we have proven that with probability one the Hausdorff dimension on the outer boundary of planar Brownian motion is 4/3, confirming a conjecture by Mandelbrot. It is also shown that the Hausdorff dimension…

Probability · Mathematics 2008-11-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…

Combinatorics · Mathematics 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

Combinatorics · Mathematics 2025-05-27 Oleg Pikhurko , Oleg Verbitsky , Maksim Zhukovskii

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Combinatorics · Mathematics 2024-08-30 Andrew Suk , Ji Zeng

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of upward outerplanar…

Discrete Mathematics · Computer Science 2021-08-30 Sujoy Bhore , Giordano Da Lozzo , Fabrizio Montecchiani , Martin Nöllenburg

In this paper, we present the first nontrivial lower bound on the translative covering density of octahedron. To this end, we show the lower bound, in any translative covering of octahedron, on the density relative to a given…

Metric Geometry · Mathematics 2023-04-18 Yiming Li , Yanlu Lian , Miao Fu , Yuqin Zhang

Letting $A \subset \mathbb{R}^n$ be Borel measurable and $W_0 : A \to \mathbb{G}(n,m)$ Lipschitzian, we establish that \begin{equation*} \limsup_{r \to 0^+} \frac{\mathcal{H}^m \left[ A \cap B(x,r) \cap (x+ W_0(x))\right]}{\alpha(m)r^m}…

Classical Analysis and ODEs · Mathematics 2021-04-13 Thierry De Pauw

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…

Classical Analysis and ODEs · Mathematics 2025-09-03 Chenjian Wang

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

Combinatorics · Mathematics 2024-09-04 Terence Tao

For $d \geq 2$ and $n \in \mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\lim_{n \in…

Probability · Mathematics 2018-08-29 Alan Hammond