Bounds for the kernel of the (, a)-generalized Fourier transform

Abstract

In this paper, we study the pointwise bounds for the kernel of the (, a)-generalized Fourier transform with 0, introduced by Ben Sa\"id, Kobayashi and Orsted. We present explicit formulas for the case a=4, which show that the kernels can exhibit polynomial growth. Subsequently, we provide a polynomial bound for the even dimensional kernel for this transform, focusing on the cases with finite order. Furthermore, by utilizing an estimation for the Prabhakar function, it is found that the (0,a)-generalized Fourier kernel is bounded by a constant when a>1 and m 2, except within an angular domain that diminishes as a → ∞. As a byproduct, we prove that the (0, 2/n)-generalized Fourier kernel is uniformly bounded, when m=2 and , n∈ N.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…