Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 120 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Upper and lower bounds for Dunkl heat kernel (2111.03513v2)

Published 5 Nov 2021 in math.FA

Abstract: On $\mathbb RN$ equipped with a normalized root system $R$, a multiplicity function $k(\alpha) > 0$, and the associated measure $$ dw(\mathbf x)=\prod_{\alpha\in R}|\langle \mathbf x,\alpha\rangle|{k(\alpha)}\, d\mathbf x, $$ let $h_t(\mathbf x,\mathbf y)$ denote the heat kernel of the semigroup generated by the Dunkl Laplace operator $\Delta_k$. Let $d(\mathbf x,\mathbf y)=\min_{\sigma\in G} | \mathbf x-\sigma(\mathbf y)|$, where $G$ is the reflection group associated with $R$. We derive the following upper and lower bounds for $h_t(\mathbf x,\mathbf y)$: for all $c_l>1/4$ and $0<c_u\<1/4$ there are constants $C_l,C_u\>0$ such that $$ C_{l}w(B(\mathbf{x},\sqrt{t})){-1}e{-c_{l}\frac{d(\mathbf{x},\mathbf{y})2}{t}} \Lambda(\mathbf x,\mathbf y,t) \leq h_t(\mathbf{x},\mathbf{y}) \leq C_{u}w(B(\mathbf{x},\sqrt{t})){-1}e{-c_{u}\frac{d(\mathbf{x},\mathbf{y})2}{t}} \Lambda(\mathbf x,\mathbf y,t), $$ where $\Lambda(\mathbf x,\mathbf y,t)$ can be expressed by means of some rational functions of $| \mathbf x-\sigma(\mathbf y)|/\sqrt{t}$. An exact formula for $\Lambda(\mathbf x,\mathbf y,t)$ is provided.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.