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

推荐订阅源

The GitHub Blog
The GitHub Blog
雷峰网
雷峰网
小众软件
小众软件
博客园 - 【当耐特】
J
Java Code Geeks
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Hugging Face - Blog
Hugging Face - Blog
腾讯CDC
Engineering at Meta
Engineering at Meta
aimingoo的专栏
aimingoo的专栏
A
About on SuperTechFans
H
Help Net Security
博客园_首页
P
Proofpoint News Feed
GbyAI
GbyAI
大猫的无限游戏
大猫的无限游戏
N
Netflix TechBlog - Medium
爱范儿
爱范儿
MyScale Blog
MyScale Blog
Blog — PlanetScale
Blog — PlanetScale
The Cloudflare Blog
MongoDB | Blog
MongoDB | Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Google DeepMind News
Google DeepMind News

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
On a Restriction Problem of Hickman and Wright for the Pa...
[Submitted on 11 Sep 2025 (v1), last revised 30 Jun 2026 (this v · 2025-09-12 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Hickman and Wright proved an $L^2$ restriction estimate for the parabola $\Sigma$ over $\mathbb{Z}/N\mathbb{Z}$ of the form
$$\left(\frac{1}{|\Sigma|}\sum\limits_{m\in\Sigma}|\widehat{f}(m)|^2 \right)^{\frac{1}{2}}\leq C_\epsilon N^\epsilon\cdot N^{-1}\left(\sum\limits_{x\in (\mathbb{Z}/N\mathbb{Z})^2}|f(x)|^\frac{6}{5}\right)^\frac{5}{6}$$
for all functions $f:(\mathbb{Z}/N\mathbb{Z})^2\rightarrow \mathbb{C}$ and any $\epsilon>0$, and showed that this bound is sharp when $N$ has a large square factor, especially for $N = p^2$ where $p$ is prime. In contrast, Mockenhaupt and Tao proved in the special case $N = p$ the stronger estimate
$$\left(\frac{1}{|\Sigma|}\sum\limits_{m\in\Sigma}|\widehat{f}(m)|^2 \right)^{\frac{1}{2}}\leq C N^{-1}\left(\sum\limits_{x\in (\mathbb{Z}/N\mathbb{Z})^2}|f(x)|^\frac{4}{3}\right)^\frac{3}{4}.$$
We extend the Mockenhaupt--Tao bound to the case of squarefree $N$, proving
$$\left(\frac{1}{|\Sigma|}\sum\limits_{m\in\Sigma}|\widehat{f}(m)|^2 \right)^{\frac{1}{2}}\leq C_\epsilon N^\epsilon\cdot N^{-1}\left(\sum\limits_{x\in (\mathbb{Z}/N\mathbb{Z})^2}|f(x)|^\frac{4}{3}\right)^\frac{3}{4},$$
and in fact a slightly sharper version with $C_\epsilon N^\epsilon$ replaced with $2^\frac{\omega(N)}{4}$, where $\omega(N)$ is the number of prime factors of $N$. We also discuss applications of this result to uncertainty principles and signal recovery.

Submission history

From: Nathaniel Kingsbury-Neuschotz [view email]
[v1] Thu, 11 Sep 2025 22:55:55 UTC (9 KB)
[v2] Tue, 30 Jun 2026 21:39:10 UTC (10 KB)