中文
相关论文

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

200 篇论文

Furstenberg, Katznelson and Weiss proved in the early 1980s that every measurable subset of the plane with positive density at infinity has the property that all sufficiently large real numbers are realised as the Euclidean distance between…

组合数学 · 数学 2013-01-18 Ian D. Morris

Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…

度量几何 · 数学 2010-03-23 Rafa Espinola , Adriana Nicolae

For a sequence of integers $\{a(x)\}_{x \geq 1}$ we show that the distribution of the pair correlations of the fractional parts of $\{ \langle \alpha a(x) \rangle \}_{x \geq 1}$ is asymptotically Poissonian for almost all $\alpha$ if the…

数论 · 数学 2016-10-18 Christoph Aistleitner , Gerhard Larcher , Mark Lewko

We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact set in any dimension, subject to attractive Robin boundary conditions. As an improvement upon our previous work…

谱理论 · 数学 2020-06-26 David Krejcirik , Vladimir Lotoreichik

We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…

概率论 · 数学 2015-11-11 Kristina Schubert , Martin Venker

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

计算几何 · 计算机科学 2021-10-08 Piotr Indyk , Tal Wagner

We prove a conjecture of T. Erd\'{e}lyi and E.B. Saff, concerning the form of the dominant term (as $N\to \infty$) of the $N$-point Riesz $d$-polarization constant for an infinite compact subset $A$ of a $d$-dimensional $C^{1}$-manifold…

度量几何 · 数学 2013-07-05 S. V. Borodachov , N. Bosuwan

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

数论 · 数学 2022-01-14 Michael Björklund , Alexander Gorodnik

In this article we prove highly improved and flexible Strichartz-type estimates allowing us to generalize the asymptotics we obtained for a stratified and rotating incompressible Navier-Stokes system: for large (and less regular) initial…

偏微分方程分析 · 数学 2020-12-09 Frederic Charve

We find a layered permutation $w\in S_n$ whose Schubert polynomial $\mathfrak S_w(x_1, \dots, x_n)$ has support of size asymptotically at least $n!/4^n$. This gives precise asymptotics for the growth rate of $\beta(n):= \max_{w\in…

组合数学 · 数学 2025-12-04 Jack Chen-An Chou , Linus Setiabrata

We present a dynamic programming algorithm for selecting a representative subset of size $k$ from a given set with $n$ points such that the Riesz $s$-energy is near minimized. While NP-hard in general dimensions, the one-dimensional case…

数据结构与算法 · 计算机科学 2025-02-11 Michael Emmerich

Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…

The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…

泛函分析 · 数学 2017-10-11 Harrison Pugh

RRT* is one of the most widely used sampling-based algorithms for asymptotically-optimal motion planning. This algorithm laid the foundations for optimality in motion planning as a whole, and inspired the development of numerous new…

机器人学 · 计算机科学 2020-04-23 Kiril Solovey , Lucas Janson , Edward Schmerling , Emilio Frazzoli , Marco Pavone

The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…

信息论 · 计算机科学 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We review our recent results on the problem of optimizing Riesz means of Laplace eigenvalues among convex sets of given measure in the regime where the cut-off parameter in the definition of the Riesz means tends to infinity. We show that…

谱理论 · 数学 2026-04-21 Rupert L. Frank , Simon Larson

A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…

概率论 · 数学 2015-07-24 Erik Duse , Anthony Metcalfe

We study the topology of the loss landscape of one-hidden-layer ReLU networks under overparameterization. On the theory side, we (i) prove that for convex $L$-Lipschitz losses with an $\ell_1$-regularized second layer, every pair of models…

机器学习 · 计算机科学 2026-02-20 Saveliy Baturin

We examine the dynamic spreading of a dense overdamped suspension of particles under power law repulsive potentials, often called Riesz gases. That is, potentials that decay with distance as 1/r^k where k\in (-2,\infty]. Depending on the…

软凝聚态物质 · 物理学 2025-01-13 Ido Fanto , Naomi Oppenheimer

We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…

概率论 · 数学 2019-03-29 Luigi Ambrosio , Federico Glaudo , Dario Trevisan