Related papers: Simultaneous packing and covering in sequence spac…

Given a collection of $m$ sets from a universe $\mathcal{U}$, the Maximum Set Coverage problem consists of finding $k$ sets whose union has largest cardinality. This problem is NP-Hard, but the solution can be approximated by a polynomial…

The Hardy-Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are stated for $p>m$. In this paper, among other results, we investigate similar results for $1\leq p\leq m.$ Let $\mathbb{K}$ be $% \mathbb{R}$ or $\mathbb{C}$ and…

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…

This is an exposition of the known techniques for constructing $\Cal L_p$-spaces for $p\in (1,\infty)\setminus \{2\}$, including some unpublished work of Alspach. Isomorphic and complemented embedding relations between these spaces are also…

This paper is intended to solve the nonconvex $\ell_{p}$-ball constrained nonlinear optimization problems. An iteratively reweighted method is proposed, which solves a sequence of weighted $\ell_{1}$-ball projection subproblems. At each…

This work concerns an alignment problem that has applications in many geospatial problems such as resource allocation and building reliable disease maps. Here, we introduce the problem of optimally aligning $k$ collections of $m$ spatial…

We obtain several new results on the simultaneous packing and covering constant $\gamma(\mathcal{X})$ of a Banach space $\mathcal{X}$, and its lattice counterpart $\gamma^*(\mathcal{X})$. These constants measure how efficient a (lattice)…

We characterise all linear maps $\mathcal{A}\colon\mathbb{R}^{n\times n}\to\mathbb{R}^{n\times n}$ such that, for $1\leq p<n$, \begin{align*} \|P\|_{L^{p^{*}}(\mathbb{R}^{n})}\leq…

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

The paper addresses the problem of defining families of ordered sequences $\{x_i\}_{i\in N}$ of elements of a compact subset $X$ of $R^d$ whose prefixes $X_n=\{x_i\}_{i=1}^{n}$, for all orders $n$, have good space-filling properties as…

We present a self-contained analysis of the stationary radiative transfer equation in weighted $L^p$ spaces. The use of weighted spaces allows us to derive uniform a-priori estimates for $1 \le p \le \infty$ under minimal assumptions on the…

Suppose that $1<p\leq\infty$ and $\varphi\in L^{p}(\mathbb{B}^{n},\mathbb{R}^{n}).$ In this note, we use H\"{o}lder inequality and some basic properties of hypergeometric functions to establish the sharp constant $C_{p}$ and function…

This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and…

Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.

Let $\mathcal{P}$ be a packing of circular disks of radius $\rho>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leq\lambda\leq\rho$. We say that $\mathcal{P}$ is a $\lambda$-separable packing of circular disks of radius $\rho$…

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Kepler (1619) and Croft (1980) have considered largest homothetic copies of one regular polytope contained in another regular polytope. For arbitrary pairs of polytopes we propose to model this as a quadratically constrained optimization…

We continue the work of \cite{TLNT}. Let $E$ be a non-Blaschke subset of the unit disc $\mathbb{D}$ of the complex plane $\mathbb{C}$. Fixed $1\leq p\leq \infty$, let $H^p(\mathbb{D})$ be the Hardy space of holomorphic functions in the disk…

We introduce the notions of almost Lipschitz embeddability and nearly isometric embeddability. We prove that for $p\in [1,\infty]$, every proper subset of $L_p$ is almost Lipschitzly embeddable into a Banach space $X$ if and only if $X$…

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…