English
Related papers

Related papers: Shallow Packings in Geometry

200 papers

Let $(X_t)_{t\ge0}$ be a Feller process generated by a pseudo-differential operator whose symbol satisfies $\|p(\cdot,\xi)\|_\infty\le c(1+|\xi|^2)$ and $p(\cdot,0)\equiv0.$ We prove that, for a large class of examples, the Hausdorff…

Probability · Mathematics 2014-11-14 Victoria Knopova , René L. Schilling , Jian Wang

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P…

Computational Geometry · Computer Science 2012-02-03 Wolfgang Mulzer , Daniel Werner

We study a natural generalization of the classical $\epsilon$-net problem (Haussler--Welzl 1987), which we call the "$\epsilon$-$t$-net problem": Given a hypergraph on $n$ vertices and parameters $t$ and $\epsilon\geq \frac t n$, find a…

Discrete Mathematics · Computer Science 2024-03-26 Noga Alon , Bruno Jartoux , Chaya Keller , Shakhar Smorodinsky , Yelena Yuditsky

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Ekkehard Koehler , Juergen Teich

We investigate the convex-body containment problem $\max\{s >0 : s Z \subseteq Q\}$, where the outer body $Q \subseteq \mathbb R^d$ is described by a membership oracle and the inner body $Z \subseteq \mathbb R^d$ is a zonotope. Our main…

Data Structures and Algorithms · Computer Science 2026-05-07 Friedrich Eisenbrand , Thomas Rothvoss , Matteo Russo , Ruben Skorupinski

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a given set $S\subseteq [n]$ if $2^S={F \cap S : F \in \mathcal{F}}$. The Sauer inequality states that in general, a set system $\mathcal{F}$ shatters at least $|\mathcal{F}|$…

Combinatorics · Mathematics 2012-11-06 Tamás Mészáros , Lajos Rónyai

In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…

Dynamical Systems · Mathematics 2017-04-26 Marta Llorente , M. Eugenia Mera , Manuel Moran

Let $H$ be an infinite-dimensional separable Hilbert space and let $(X,d,\mu)$ be a metric measure space satisfying the doubling and upper Alhfors regularity conditions at small scale. We prove that every bounded continuous tight frame…

Functional Analysis · Mathematics 2026-03-12 Marcin Bownik , Pu-Ting Yu

A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…

Discrete Mathematics · Computer Science 2021-05-25 Denis S. Krotov , Vladimir N. Potapov

For any set system $H=(V,R), \ R \subseteq 2^V$, a subset $S \subseteq V$ is called \emph{shattered} if every $S' \subseteq S$ results from the intersection of $S$ with some set in $\R$. The \emph{VC-dimension} of $H$ is the size of a…

Data Structures and Algorithms · Computer Science 2024-05-14 David Coudert , Mónika Csikós , Guillaume Ducoffe , Laurent Viennot

The statistics of peaks in weak gravitational lensing maps is a promising technique to constrain cosmological parameters in present and future surveys. Here we investigate its power when using general extreme value statistics which is very…

Cosmology and Nongalactic Astrophysics · Physics 2016-12-12 Robert Reischke , Matteo Maturi , Matthias Bartelmann

Let $X$ be a set and ${\mathcal H}$ a collection of functions from $X$ to $\{0,1\}$. We say that ${\mathcal H}$ shatters a finite set $C \subset X$ if the restriction of ${\mathcal H}$ yields every possible function from $C$ to $\{0,1\}$.…

Combinatorics · Mathematics 2021-08-31 D. Fitzpatrick , A. Iosevich , B. McDonald , E. Wyman

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Algebraic Geometry · Mathematics 2024-10-15 Claus Scheiderer

In terms of the minimal $N$-point diameter $D_d(N)$ for $R^d,$ we determine, for a class of continuous real-valued functions $f$ on $[0,+\infty],$ the $N$-point $f$-best-packing constant $\min\{f(\|x-y\|)\, :\, x,y\in \R^d\}$, where the…

Mathematical Physics · Physics 2012-04-20 A. V. Bondarenko , D. P. Hardin , E. B. Saff

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

Combinatorics · Mathematics 2018-04-03 Bart Litjens

A set $B$ of vertices in a graph $G$ is called a \emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$,…

Combinatorics · Mathematics 2018-07-04 Xuqing Bai , Hong Chang , Xueliang Li

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

We propose a vector dark matter model from a hidden SU(2)_D gauge symmetry at TeV scale. A scalar septuplet is introduced to break the SU(2)_D symmetry spontaneously. The septuplet also play the role of a portal between the standard model…

High Energy Physics - Phenomenology · Physics 2023-01-04 Zhao Zhang , Chengfeng Cai , Hong-Hao Zhang

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

Combinatorics · Mathematics 2025-09-09 Matěj Trödler , Jan Volec , Jan Vybíral