Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dimension free weak-type endpoint estimates for the vectors of the Dunkl--Riesz transform

Published 8 Sep 2026 in math.AP, math.CA, and math.FA | (2609.08492v1)

Abstract: Let RR<sup>dR\subset\mathbb{R}<sup>d be a reduced root system, GG the associated finite reflection group, and k0k\ge0 a GG-invariant multiplicity function. We develop a Dunkl analogue of the obstacle/partial-balayage method of Ouyang, Spector, and Stockdale (https://arxiv.org/abs/2608.18068) for the Euclidean fractional Laplacian. For $0&lt;s\&lt;2$, nonnegative fL1(νk)L2(νk)f\in L^1(ν_k)\cap L^2(ν_k), and λ&gt;0λ\&gt;0, we obtain a decomposition [ f=μ+(-Δk){s/2}u, \qquad 0\leμ\leλ, ] with μ=λμ=λ on $Ω={u&gt;0}$ and [ λν_k(Ω)\le|f|{L1(ν_k)}. ] As an application, we prove that the vector Dunkl--Riesz transform Rk=k(Δ<em>k)<sup>1/2\mathcal R_k=\nabla_k(-Δ<em>k)<sup>{-1/2} is of weak type (1,1)(1,1) with constant at most (Mk+2)(M_k+2), where [ M_k=#{α\in R+:k(α)>0}. ] For GG-invariant functions, the reflection terms vanish and the same argument gives the universal constant $2$. We further establish a dimension-free weak-type (1,1)(1,1) estimate for the Dunkl--Schrödinger Riesz transform.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.