English
Related papers

Related papers: Bounds for totally separable translative packings …

200 papers

In 1969, Fejes Toth conjectured that in Euclidean 3-space any packing of equal balls such that each ball is touched by twelve others consists of hexagonal layers. This article verifies this conjecture.

Metric Geometry · Mathematics 2012-09-27 Thomas C. Hales

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

Computational Geometry · Computer Science 2011-12-01 Alina Ene , Sariel Har-Peled , Benjamin Raichel

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$ in the Euclidean plane, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$…

Metric Geometry · Mathematics 2024-03-26 Bushra Basit , Zsolt Lángi

The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…

Metric Geometry · Mathematics 2015-01-14 Henry Cohn , Yufei Zhao

It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…

Classical Analysis and ODEs · Mathematics 2025-03-27 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…

Metric Geometry · Mathematics 2016-09-14 Thomas Hales , Wöden Kusner

A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that…

Optimization and Control · Mathematics 2014-12-02 Shyan S. Akmal , Nguyen Mau Nam , J. J. P. Veerman

Constrained diffusions in convex polyhedral domains with a general oblique reflection field, and with a diffusion coefficient scaled by a small parameter, are considered. Using an interior Dirichlet heat kernel lower bound estimate for…

Probability · Mathematics 2013-08-19 Amarjit Budhiraja , Zhen-Qing Chen

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

Alberti, Cs\"ornyei and Preiss introduced a notion of a "pointwise (weak) tangent field" for a subset of Euclidean space -- a field that contains almost every tangent line of every curve passing through the set -- and showed that all…

Classical Analysis and ODEs · Mathematics 2026-04-20 Guy C. David , Sylvester Eriksson-Bique , Raanan Schul

This review describes the diversity of jammed configurations attainable by frictionless convex nonoverlapping (hard) particles in Euclidean spaces and for that purpose it stresses individual-packing geometric analysis. A fundamental feature…

Statistical Mechanics · Physics 2015-05-19 Salvatore Torquato , Frank H. Stillinger

A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…

Optimization and Control · Mathematics 2020-03-26 Phung Huynh The

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

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

Metric Geometry · Mathematics 2024-02-08 Bushra Basit , Zsolt Lángi

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

Metric Geometry · Mathematics 2009-09-25 Gabor Fejes Tóth , Greg Kuperberg , Włodzimierz Kuperberg

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…

Analysis of PDEs · Mathematics 2011-07-07 Alessio Figalli , Young-Heon Kim , Robert J. McCann

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if the space $L^2(\Omega)$ has an orthogonal basis of exponential functions. A conjecture due to Fuglede (1974) stated that $\Omega$ is a spectral set if and only if it can tile the…

Classical Analysis and ODEs · Mathematics 2022-07-05 Nir Lev , Máté Matolcsi

Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…

Soft Condensed Matter · Physics 2015-05-13 Yang Jiao , Frank Stillinger , Sal Torquato

We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold…

Combinatorics · Mathematics 2015-03-17 Balázs Keszegh , Dömötör Pálvölgyi

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy
‹ Prev 1 3 4 5 6 7 10 Next ›