English
Related papers

Related papers: No new lower bound for the density of planar Sets …

200 papers

By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erd\H{o}s that the density of any measurable planar set avoiding unit distances cannot exceed $1/4$. Our argument implies the upper bound of…

Metric Geometry · Mathematics 2024-06-25 Gergely Ambrus , Adrián Csiszárik , Máté Matolcsi , Dániel Varga , Pál Zsámboki

Determining the maximal density $m_1(\mathbb{R}^2)$ of planar sets without unit distances is a fundamental problem in combinatorial geometry. This paper investigates lower bounds for this quantity. We introduce a novel approach to…

Metric Geometry · Mathematics 2025-04-14 Alexander Tolmachev

We improve the best known upper bound on the density of a planar measurable set A containing no two points at unit distance to 0.25442. We use a combination of Fourier analytic and linear programming methods to obtain the result. The…

Metric Geometry · Mathematics 2020-12-15 Gergely Ambrus , Máté Matolcsi

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

Metric Geometry · Mathematics 2018-03-12 Tamás Keleti , Máté Matolcsi , Fernando Mário de Oliveira Filho , Imre Z. Ruzsa

In the 1960s Moser asked how dense a subset of $\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense…

Metric Geometry · Mathematics 2024-07-09 Alex Cohen , Nitya Mani

In this paper we derive new upper bounds for the densities of measurable sets in R^n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new…

Combinatorics · Mathematics 2010-09-17 Fernando Mario de Oliveira Filho , Frank Vallentin

A subset $A \subset \mathbb R^2$ is said to avoid distance $1$ if: $\forall x,y \in A, \left\| x-y \right\|_2 \neq 1.$ In this paper we study the number $m_1(\mathbb R^2)$ which is the supremum of the upper densities of measurable sets…

Metric Geometry · Mathematics 2023-06-22 Thomas Bellitto , Arnaud Pêcher , Antoine Sédillot

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

The maximal density of a measurable subset of R^n avoiding Euclidean distance1 is unknown except in the trivial case of dimension 1. In this paper, we consider thecase of a distance associated to a polytope that tiles space, where it is…

Combinatorics · Mathematics 2017-08-02 Christine Bachoc , Thomas Bellitto , Philippe Moustrou , Arnaud Pêcher

We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…

Computational Complexity · Computer Science 2014-07-09 Thomas P. Hayes , Cristopher Moore

We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known…

Metric Geometry · Mathematics 2022-06-07 Thomas Fernique

For estimating a lower bounded location or mean parameter for a symmetric and logconcave density, we investigate the frequentist performance of the $100(1-\alpha)%$ Bayesian HPD credible set associated with priors which are truncations of…

Statistics Theory · Mathematics 2008-11-13 Éric Marchand , William E. Strawderman , Keven Bosa , Aziz Lmoudden

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

The local theory of regular or multi-regular systems aims at finding sufficient local conditions for a Delone set $X$ to be a regular or multi-regular system. One of the main goals is to estimate the regularity radius $\hat{\rho}_d$ for…

In this paper we study the blow-ups of the singular points in the boundary of a minimizing cluster lying in the interface of more than two chambers. We establish a sharp lower bound for the perimeter density at those points and we prove…

Analysis of PDEs · Mathematics 2018-01-30 Jonas Hirsch , Michele Marini

Let $X$ be any subset of the interval $[-1,1]$. A subset $I$ of the unit sphere in $R^n$ will be called \emph{$X$-avoiding} if $<u,v >\notin X$ for any $u,v \in I$. The problem of determining the maximum surface measure of a $\{ 0…

Combinatorics · Mathematics 2015-02-26 Evan DeCorte , Oleg Pikhurko

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

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Combinatorics · Mathematics 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki

We prove lower bounds on the density of regular minimal cones of dimension less than seven provided the complements of the cones are topologically nontrivial.

Differential Geometry · Mathematics 2025-07-23 Jacob Bernstein , Lu Wang

The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960…

Number Theory · Mathematics 2013-10-10 Nathan McNew
‹ Prev 1 2 3 10 Next ›