惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
月光博客
月光博客
aimingoo的专栏
aimingoo的专栏
Google DeepMind News
Google DeepMind News
Recent Announcements
Recent Announcements
MyScale Blog
MyScale Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
Hugging Face - Blog
Hugging Face - Blog
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
F
Fortinet All Blogs
小众软件
小众软件
D
Docker
U
Unit 42
博客园 - 聂微东
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
爱范儿
爱范儿
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
IT之家
IT之家
云风的 BLOG
云风的 BLOG
博客园 - 司徒正美
有赞技术团队
有赞技术团队
腾讯CDC

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Kusner's conjecture: Exact values and linear bounds
Hong-Jun Ge, Zixiang Xu, Yang Zhou · 2026-06-03 · via math updates on arXiv.org

In 1983, Kusner conjectured that the largest equilateral set in $\mathbb{R}^{n}$ with metric $\ell_{p}$ has cardinality $n+1$ when $1<p<\infty$ and $2n$ when $p=1.$ This conjecture was proved only in the isolated cases $p=2$ and $p=4$, and was disproved when $1<p<2$. The best general upper bound $O_p(n^{\frac{2p+2}{2p-1}})$ is due to the celebrated work of Alon and Pudlák~[GAFA, 2003]. Our main contributions include: (1) We prove Kusner's conjecture for every dimension $n\ge 1$ when $2\le p\le 4$. More generally, for every integer $k\ge 0$ and every $p\in[4k+2,4k+4]$, every equilateral set in \(\mathbb{R}^{n}\) with metric $\ell_p$ has cardinality at most $(2k+1)n+1$. On the complementary intervals $p\in(4k,4k+2)$ with $p\geq 1$, we obtain the almost linear bound $O_p(n\log n)$. (2) We also consider the analogous problem on the torus $\mathbb{T}^n$, recently initiated by Alon, where the cyclic distance makes the problem substantially more delicate than in $\mathbb R^n$. We prove the almost linear bound $O_p(n\log n)$ for $1\le p\le 2$ and $O_p(n^{\frac{3}{2}-\frac{1}{p}})$ for every fixed real $p>2$, improving Alon's bounds $O_p(n^{2+\frac{2}{\lfloor p\rfloor}})$ for all finite $p\ge 1$.