中文
相关论文

相关论文: Asymptotics of Best-Packing on Rectifiable Sets

200 篇论文

Motivated by the manifold hypothesis, which states that data with a high extrinsic dimension may yet have a low intrinsic dimension, we develop refined statistical bounds for entropic optimal transport that are sensitive to the intrinsic…

统计理论 · 数学 2023-08-25 Austin J. Stromme

Determinantal point processes exhibit an inherent repulsive behavior, thus providing examples of very evenly distributed point sets on manifolds. In this paper, we study the so-called harmonic ensemble, defined in terms of Laplace…

经典分析与常微分方程 · 数学 2024-02-20 Bence Borda , Peter Grabner , Ryan W. Matzke

Here we study the multipacking problems for geometric point sets with respect to their Euclidean distances. We consider a set of $n$ points $P$ and define $N_s[v]$ as the subset of $P$ that includes the $s$ nearest points of $v \in P$ and…

计算几何 · 计算机科学 2025-07-16 Arun Kumar Das , Sandip Das , Sk Samim Islam , Ritam M Mitra , Bodhayan Roy

We show that given any six numbers $r,s,t,u,v,w \in (0,1]$ satisfying $r \leq s \leq \min(t,u) \leq \max(t,u) \leq v \leq w$, it is possible to construct a compact subset of $[0,1]$ with Hausdorff dimension equal to $r$, lower modified box…

度量几何 · 数学 2018-12-27 Andrew Mitchell , Lars Olsen

In this work, we employ differential evolution algorithm to identify the optimal configurations of small atomic ensembles supporting quantum states with maximal radiative lifetime. We demonstrate that atoms mostly tend to assemble in…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

组合数学 · 数学 2017-12-06 Daniel Heinlein , Sascha Kurz

We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatize key properties of sphere packing bounds…

度量几何 · 数学 2021-08-26 Henry Cohn , Andrew Salmon

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…

概率论 · 数学 2010-12-22 Charles Bordenave , Giovanni Luca Torrisi

We consider the problem of placing n small balls of given radius in a certain domain subject to a force f in order to minimize the compliance of the configuration. Then we let n tend to infinity and look at the asymptotics of the…

经典分析与常微分方程 · 数学 2007-05-23 G. Buttazzo , F. Santambrogio , N. Varchon

We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…

数论 · 数学 2025-03-05 Felipe Gonçalves , Guilherme Vedana

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

经典分析与常微分方程 · 数学 2019-12-17 Tamás Keleti , Pablo Shmerkin

We consider the minimization of integral functionals in one dimension and their approximation by $r$-adaptive finite elements. Including the grid of the FEM approximation as a variable in the minimization, we are able to show that the…

数值分析 · 数学 2025-10-31 Darith Hun , Nicolas Moës , Heiner Olbermann

Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…

数学物理 · 物理学 2019-02-20 Douglas P. Hardin , Timothy J. Michaels , Edward B. Saff

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

组合数学 · 数学 2023-12-20 Hiroshi Nozaki , Masashi Shinohara , Sho Suda

The asymptotically optimal version of Rapidly-exploring Random Tree (RRT*) is often used to find optimal paths in a high-dimensional configuration space. The well-known issue of RRT* is its slow convergence towards the optimal solution. A…

机器人学 · 计算机科学 2025-03-21 Jonáš Kříž , Vojtěch Vonásek

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…

We introduce a generalization of the well-known random sequential addition (RSA) process for hard spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$. We show that all of the $n$-particle correlation functions of this nonequilibrium…

软凝聚态物质 · 物理学 2009-11-11 S. Torquato , F. H. Stillinger

We study the asymptotic distribution, as the volume parameter goes to 1, of the peak (largest part) of finite- or slowly-growing-width cylindric plane partitions weighted by their trace, seam, and volume. There are two natural asymptotic…

概率论 · 数学 2021-12-01 Dan Betea , Alessandra Occelli

The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…

组合数学 · 数学 2021-09-08 Chun-Hung Liu

We consider a class of manifolds $\mathcal{M}$ obtained by taking the connected sum of a finite number of $N$-dimensional Riemannian manifolds of the form $(\mathbb{R}^{n_i}, \delta) \times (\mathcal{M}_i, g)$, where $\mathcal{M}_i$ is a…

偏微分方程分析 · 数学 2019-12-16 Andrew Hassell , Daniel Nix , Adam Sikora