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

推荐订阅源

美团技术团队
N
Netflix TechBlog - Medium
WordPress大学
WordPress大学
云风的 BLOG
云风的 BLOG
J
Java Code Geeks
V
Visual Studio Blog
H
Help Net Security
Engineering at Meta
Engineering at Meta
Hugging Face - Blog
Hugging Face - Blog
Microsoft Security Blog
Microsoft Security Blog
腾讯CDC
博客园 - 【当耐特】
B
Blog
Stack Overflow Blog
Stack Overflow Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
大猫的无限游戏
大猫的无限游戏
GbyAI
GbyAI
博客园 - 司徒正美
博客园 - 叶小钗
Y
Y Combinator Blog
MyScale Blog
MyScale Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
G
Google Developers Blog
酷 壳 – CoolShell
酷 壳 – CoolShell

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
Additive structures imply more distances in $\mathbb{F}_q^d$
Daewoong Cheong, Gennian Ge, Doowon Koh, Thang Pham, Dung The Tr · 2025-10-30 · via math updates on arXiv.org

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $Δ(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the Erdős--Falconer distance problem within the flexible class of $(u, s)$--Salem sets introduced by Jonathan M. Fraser, with emphasis on the even case $u = 4$. By exploiting the exact identity between $\|\widehat{E}\|_4$ and the fourth additive energy $Λ_4(E)$, we prove that quantitative gains in $Λ_4(E)$ force the existence of many distances. In particular, for a $(4, s)$--Salem set $E\subset \mathbb{F}_q^d$ with $d \geq 2$, if \[ |E|\gg q^{\min\left\{\frac{d+2}{4s+1}, \frac{d+4}{8s}\right\}}, \] then $E$ determines a positive proportion of all distances. This strictly improves Fraser's threshold of $\frac{d}{4s}$ and the Iosevich-Rudnev bound of $q^{\frac{d+1}{2}}$ in certain parameter ranges. As applications, we obtain improved thresholds for multiplicative subgroups and sets on arbitrary varieties, and establish a sharp incidence bound for Salem sets that is of independent interest in incidence geometry. Moreover, our methods give sharp lower bounds for the number of distinct distances determined by two different sets. We also propose a unified conjecture for $(4, s)$--Salem sets that reconciles known bounds and pinpoints the odd-dimensional sphere regime: in odd dimensions $d \geq 3$, the often-cited $\frac{d-1}{2}$ threshold does not follow without additional structures. This provides a clear picture of the spherical distance conjecture.