Related papers: Simultaneous packing and covering in sequence spac…

In this paper, we study stability of $M$-compactness for $l^p$ sum of Banach spaces for $1\leq p<\infty$. We also obtain a characterization of $M$-compact sets in terms of statistically maximizing sequence, a notion which is weaker than a…

For points $p_1,\ldots , p_n$ in the unit square $[0,1]^2$, an \emph{anchored rectangle packing} consists of interior-disjoint axis-aligned empty rectangles $r_1,\ldots , r_n\subseteq [0,1]^2$ such that point $p_i$ is a corner of the…

In 1900, as a part of his 18th problem, Hilbert proposed the question to determine the densest congruent (or translative) packings of a given solid, such as the unit ball or the regular tetrahedron of unit edges. Up to now, our knowledge…

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $\Pi$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_{\Pi}[\textrm{for all }x, \ \|Ax\|_p \leq \|\Pi Ax\|_p \leq \kappa \|Ax\|_p] \geq 9/10,$$…

This paper studies the relationship between volume and surface uniform measures on n-dimensional p-balls under the p-norm. It is proved that for p=1, p=2 and p=infinity, and only for these values of p, radial projection maps a…

Very recently, \v{S}pakula and Tikuisis provide a new characterisation of (uniform) Roe algebras via quasi-locality when the underlying metric spaces have straight finite decomposition complexity. In this paper, we improve their method to…

A Bl-packing is a (branched) circle packing that ``properly covers'' the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show…

Motivated by the inequality $\|f+g\|_{2}^{2} \leq \|f\|_{2}^{2}+2\|fg\|_{1}+\|g\|^{2}_{2}$, Carbery (2006) raised the question what is the "right" analogue of this estimate in $L^{p}$ for $p \neq 2$. Carlen, Frank, Ivanisvili and Lieb…

We prove that every proper ultrametric space isometrically embeds into $\ell_p$ for any $p\geq 1$. As an application we discuss an $\ell_p$-version of nonlinear Dvoretzky's theorem.

As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…

We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$,…

In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…

Let (M, g) be a complete Riemannian manifold. Assume that the Ricci curvature of M has quadratic decay and that the volume growth is strictly faster than quadratic. We establish that the Hardy spaces of exact 1-differential forms on M ,…

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

To prove by probabilistic methods that every $(n-1)$-dimensional section of the unit cube in $R^n$ has volume at most $\sqrt 2$, K. Ball made essential use of the inequality $$ \frac{1}{\pi}\int_{-\infty}^{\infty} \left(\frac{\sin^2…