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

推荐订阅源

P
Proofpoint News Feed
博客园_首页
WordPress大学
WordPress大学
大猫的无限游戏
大猫的无限游戏
有赞技术团队
有赞技术团队
阮一峰的网络日志
阮一峰的网络日志
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
酷 壳 – CoolShell
酷 壳 – CoolShell
Y
Y Combinator Blog
Vercel News
Vercel News
The GitHub Blog
The GitHub Blog
T
The Blog of Author Tim Ferriss
云风的 BLOG
云风的 BLOG
博客园 - 司徒正美
Engineering at Meta
Engineering at Meta
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
J
Java Code Geeks
Stack Overflow Blog
Stack Overflow Blog
N
Netflix TechBlog - Medium
Martin Fowler
Martin Fowler
宝玉的分享
宝玉的分享
G
Google Developers Blog
Last Week in AI
Last Week in AI

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
Optimal dimension-dependent $\ell^p$ and $\ell^{1,\infty}...
[Submitted on 18 Jun 2026] · 2026-06-19 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:In this paper, we are concerned with the optimal dimension-dependent $\ell^p$ norm of the discrete Riesz Transforms $R_{\text{dis}}^{(k)}$ on $\mathbb{Z}^d$ given by the singular convolution kernel $K_k(m)=c_d m_k/|m|^{d+1}$, where $c_d=\Gamma(\frac{d+1}{2})/\pi^{(d+1)/2}$ .
We show that for fixed $1<p<\infty$, when $d\to \infty$ $$\|R_{dis}^{\left( k \right)}\|_{\ell ^p\left( \mathbb{Z}^d \right) \rightarrow \ell ^p\left( \mathbb{Z}^d \right)}=2c_d\left( 1+\frac{\left( \sqrt{2}+o\left( 1 \right) \right) d}{2^{\frac{d}{2}}} \right) .$$ The operator norm of $R_{\text{dis}}^{(k)}$ grows super-exponentially as $d\to\infty$ since $c_d\sim(\frac{d-1}{2e\pi})^{\frac{d-1}{2}}\sqrt{\frac{d-1}{\pi}}$ by Stirling's formula, which gives a negative answer to the conjecture proposed by Bañuelos, Kim and Kwaśnicki in \cite{BKK}. The optimal dimension-dependent $\ell^{1,\infty}$ estimate of $R_{\text{dis}}^{(k)}$ is also established.

Submission history

From: Hanli Tang [view email]
[v1] Thu, 18 Jun 2026 06:40:41 UTC (16 KB)