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

推荐订阅源

博客园_首页
爱范儿
爱范儿
罗磊的独立博客
V
V2EX
量子位
Last Week in AI
Last Week in AI
Hugging Face - Blog
Hugging Face - Blog
博客园 - 司徒正美
Jina AI
Jina AI
博客园 - 叶小钗
小众软件
小众软件
博客园 - 【当耐特】
Y
Y Combinator Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
T
Tailwind CSS Blog
博客园 - 聂微东
Microsoft Security Blog
Microsoft Security Blog
美团技术团队
P
Proofpoint News Feed
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
有赞技术团队
有赞技术团队
MongoDB | Blog
MongoDB | Blog
Recent Announcements
Recent Announcements
酷 壳 – 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
Calderon-type commutators and chamber lifting in the Dunk...
[Submitted on 25 May 2026] · 2026-05-26 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study Calderón-type commutators $[M_b,T_i\mathcal R_j]$ in the rational Dunkl setting with a finite reflection group $G$. If $b$ belongs to the orbit Lipschitz class $\operatorname{Lip}_d$, then for every $1<p<\infty$ we prove $$\|[M_b,T_i\mathcal R_j]f\|_{L^p(\mathbb{R}^N,d\omega)}\le C_p\|b\|_{\operatorname{Lip}_d}\|f\|_{L^p(\mathbb{R}^N,d\omega)}.$$ No $G$-invariance is imposed on the input function $f$.
The key is a chamber lifting: fix a closed Weyl chamber $\mathcal C$ and set $Uf(x)=(f(\sigma_1x),\dots,f(\sigma_{|G|}x))$ for $x\in\mathcal C$. This identifies $L^p(\mathbb{R}^N,d\omega)$ with $L^p(\mathcal C,d\omega;\ell_{|G|}^p)$. Under this lifting, the orbit singularity becomes the ordinary diagonal on $\mathcal C$ and the commutator becomes a finite matrix singular integral on $\mathcal C$. We construct it via heat-scale regularizations, prove component $T1$ testing for chamber indicators, and then apply scalar Calderón--Zygmund theory to obtain the $L^p$ bounds.

Submission history

From: Liangchuan Wu [view email]
[v1] Mon, 25 May 2026 13:01:43 UTC (46 KB)