Related papers: Asymptotics of Best-Packing on Rectifiable Sets
The self-consistent expansion (SCE) is a powerful technique for obtaining perturbative solutions to problems in statistical physics but it suffers from a subtle problem - too much freedom! The SCE can be used to generate an enormous number…
We settle the problem of determining the asymptotic behavior of the parameters of optimal difference systems of sets, or DSSes for short, which were originally introduced for computationally efficient frame synchronization under the…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
Motivated by recent interest in elastic problems in which the target space is non-Euclidean, we study a limit where local rest distances within an elastic body are incompatible, yet close to, distances within the ambient space.…
We study the singular set of free interface in an optimal partition problem for the Dirichlet eigenvalues. We prove that its upper $(n-2)$-dimensional Minkowski content, and consequently, its $(n-2)$-dimensional Hausdorff measure are…
A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…
We study the asymptotic behaviour of the maximum interpoint distance of random points in a planar bounded set with an unique major axis and a boundary behaving like an ellipse at the endpoints. Our main result covers the case of uniformly…
We study the optimal partitioning of a (possibly unbounded) interval of the real line into $n$ subintervals in order to minimize the maximum of certain set-functions, under rather general assumptions such as continuity, monotonicity, and a…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
The present paper is devoted to establishing an optimal approximation exponent for the action of an irreducible uniform lattice subgroup of a product group on its proper factors. Previously optimal approximation exponents for lattice…
A (tandem) duplication of length $ k $ is an insertion of an exact copy of a substring of length $ k $ next to its original position. This and related types of impairments are of relevance in modeling communication in the presence of…
We consider the sensor network localization problem, which is closely related to multidimensional scaling and Euclidean distance matrix completion. Given a ground truth configuration of $n$ points in $\mathbb{R}^\ell$, we observe a subset…
Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of all of the robots in the space. The dimensionality of this…
We consider a non-trapping $n$-dimensional Lorentzian manifold endowed with an end structure modeled on the radial compactification of Minkowski space. We find a full asymptotic expansion for tempered forward solutions of the wave equation…
For a nonincreasing function $\psi$, let $\textrm{Exact}(\psi)$ be the set of complex numbers that are approximable by complex rational numbers to order $\psi$ but to no better order. In this paper, we obtain the Hausdorff dimension and…
The set of real numbers which are badly approximable by rationals admits an exhaustion by sets Bad($\epsilon$), whose dimension converges to 1 as $\epsilon$ goes to zero. D. Hensley computed the asymptotic for the dimension up to the first…
In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a convex body, i.e., a compact convex set in Euclidean space with interior points. We shall not impose any regularity…
Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
We study the Hausdorff and box-counting dimensions of cookie-cutter-like sets formed by sequential dynamics of a finite number of expanding maps. Under some natural conditions, these dimensions turn out to be the minimum and maximum of the…