English
Related papers

Related papers: Bounds for totally separable translative packings …

200 papers

Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models…

Information Theory · Computer Science 2013-10-01 Rafah El-Khatib , Nicolas Macris , Ruediger Urbanke

Martingale transport plans on the line are known from Beiglbock & Juillet to have an irreducible decomposition on a (at most) countable union of intervals. We provide an extension of this decomposition for martingale transport plans in R^d,…

Probability · Mathematics 2018-01-22 Hadrien De March , Nizar Touzi

In this paper we consider ball packings in $4$-dimensional hyperbolic space. We show that it is possible to exceed the conjectured $4$-dimensional realizable packing density upper bound due to L. Fejes T\'oth (Regular Figures, 1964). We…

Metric Geometry · Mathematics 2014-08-25 Robert Thijs Kozma , Jenő Szirmai

It is conjectured that for every convex disks K, the translative covering density of K and the lattice covering density of K are identical. It is well known that this conjecture is true for every centrally symmetric convex disks. For the…

Metric Geometry · Mathematics 2016-01-19 Kirati Sriamorn , Fei Xue

We consider an optimal stretching problem for strictly convex domains in $\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$.…

Metric Geometry · Mathematics 2022-03-03 Nicholas F. Marshall

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

Computational Geometry · Computer Science 2022-11-29 Mook Kwon Jung , Sang Duk Yoon , Hee-Kap Ahn , Takeshi Tokuyama

The aim of this paper is to study lattice-like coverings with congruent translation balls and the packings and coverings with a type of translation cylinders in Sol space related to the fundamental lattices. We introduce the notions of the…

Metric Geometry · Mathematics 2025-12-04 Judit Sajtos , Jenő Szirmai

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

Computational Geometry · Computer Science 2024-08-07 Mikkel Abrahamsen , Tillmann Miltzow , Nadja Seiferth

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

Optimization and Control · Mathematics 2025-01-29 Adrian S. Lewis , Adriana Nicolae , Tonghua Tian

Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…

Metric Geometry · Mathematics 2012-11-14 D. Gerbner , G. Tóth

The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…

Functional Analysis · Mathematics 2016-07-18 Bernhard G. Bodmann , John I. Haas

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

Computational Geometry · Computer Science 2023-07-04 Hyuk Jun Kweon , Honglin Zhu

We prove sphere packing density bounds in hyperbolic space (and more generally irreducible symmetric spaces of noncompact type), which were conjectured by Cohn and Zhao and generalize Euclidean bounds by Cohn and Elkies. We work within the…

Metric Geometry · Mathematics 2026-03-23 Maximilian Wackenhuth

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

Combinatorics · Mathematics 2019-09-11 Istvan Tomon

Inspired by the concept of coherent frozen waves, this paper introduces one possible theoretical framework of its partially coherent version, a frozen spatial coherence, in which a desired two-point correlation structure of an optical field…

Optics · Physics 2022-06-22 M. A. Pinto , P. A. Brandão

This purpose of this paper is to prove the following result: let phi be a strictly convex, smooth, convex body in the Euclidean plane, if the intersection of n translates of phi has a non-empty interior, and all of the translates contribute…

Geometric Topology · Mathematics 2026-05-01 Cameron Strachan

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

A 1972 duality conjecture due to Pietsch asserts that the entropy numbers of a compact operator acting between two Banach spaces and those of its adjoint are (in an appropriate sense) equivalent. This is equivalent to a dimension free…

Functional Analysis · Mathematics 2007-05-23 S. Artstein , V. Milman , S. J. Szarek , N. Tomczak-Jaegermann

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

Computational Geometry · Computer Science 2021-08-27 Adrian Dumitrescu , Josef Tkadlec

Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…

Combinatorics · Mathematics 2020-02-25 Sergey Bereg , Mohammadreza Haghpanah