Related papers: Asymptotics of Best-Packing on Rectifiable Sets

This paper considers the uplink of a distributed Massive MIMO network where $N$ base stations (BSs), each equipped with $M$ antennas, receive data from $K=2$ users. We study the asymptotic spectral efficiency (as $M\to \infty$) with spatial…

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

We characterise purely $n$-unrectifiable subsets $S$ of a complete metric space $X$ with finite Hausdorff $n$-measure by studying arbitrarily small perturbations of elements of the set of all bounded 1-Lipschitz functions $f\colon X \to…

We revisit a classical problem in dynamic storage allocation. Items arrive in a linear storage medium, modeled as a half-axis, at a Poisson rate $r$ and depart after an independent exponentially distributed unit mean service time. The…

We consider the minimum Riesz $s$-energy problem on the unit disk $\mathbb D:=\{(x_1,\ldots,x_d)\in\mathbb R^d: x_1=0, x_2^2+x_3^2+\ldots+x_d^2\leq 1\}$ in the Euclidean space $\mathbb R^d$, $d\geq 3$, immersed into a smooth rotationally…

This paper is devoted to spherical measures and point configurations optimizing three-point energies. Our main goal is to extend the classic optimization problems based on pairs of distances between points to the context of three-point…

In this paper, we characterize the rectifiability (both uniform and not) of an Ahlfors regular set, E, of arbitrary co-dimension by the behavior of a regularized distance function in the complement of that set. In particular, we establish a…

We consider analytic functions from a reproducing kernel Hilbert space. Given that such a function is of order $\epsilon$ on a set of discrete data points, relative to its global size, we ask how large can it be at a fixed point outside of…

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

We characterize the asymptotic behaviour of the compression associated to a uniform embedding into some Lp-space for a large class of groups including connected Lie groups with exponential growth and word-hyperbolic finitely generated…

This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…

Let $P$ be a probability distribution on $\mathbb{R}^d$ (equipped with an Euclidean norm $|\cdot|$). Let $ r> 0 $ and let $(\alpha_n)_{n \geq1}$ be an (asymptotically) $L^r(P)$-optimal sequence of $n$-quantizers. We investigate the…

Let P be an hyperplane in R^N, and denote by dH the Hausdorff distance. We show that for all positive radius r < 1 there is an epsilon > 0, such that if K is a Reifenberg-flat set in B(0; 1), a ball in R^N, that contains the origin, with…

Let $0 \leq s \leq 1$. A set $K \subset \mathbb{R}^{2}$ is a Furstenberg $s$-set, if for every unit vector $e \in S^{1}$, some line $L_{e}$ parallel to $e$ satisfies $$\dim_{\mathrm{H}} [K \cap L_{e}] \geq s.$$ The Furstenberg set problem,…

A Besicovitch set is a set which contains a unit line segment in any direction. It is known that the Minkowski and Hausdorff dimensions of such a set must be greater than or equal to 5/2 in \R^3. In this paper we show that the Minkowski…

We consider the problem of maximizing the first eigenvalue of the $p$-laplacian (possibly with non-constant coefficients) over a fixed domain $\Omega$, with Dirichlet conditions along $\partial\Omega$ and along a supplementary set $\Sigma$,…

We consider a particle governed by a one-dimensional Hamiltonian in which artificial periodic spin-orbit coupling and Zeeman lattice have incommensurate periods. Using best rational approximations to such quasiperiodic Hamiltonian, the…

In this work, we study the optimal configuration of the physical layer in wireless networks by means of Semi-Markov Decision Process (SMDP) modeling. In particular, assume the physical layer is characterized by a set of potential operating…

The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski…

We analyse the asymptotic behaviour of random instances of the Maximum Set Packing (MSP) optimization problem, also known as Maximum Matching or Maximum Strong Independent Set on Hypergraphs. We give an analytical prediction of the MSPs…