Related papers: A Generalization of Fueter's Theorem in Dunkl-Clif…
In this paper is extended the original theorem by Fueter-Sce (assigning an $\mathbb R_{0,m}$-valued monogenic function to a $\mathbb C$-valued holomorphic function) to the higher order case. We use this result to prove Fueter's theorem with…
In this paper we present a generalization of the Fueter's theorem for monogenic functions to the case of the biregular functions of Clifford analysis.
We show that Fueter's theorem holds for a more general class of quaternionic functions than those constructed by the Fueter's method.
Tnis paper deals with some special integral transforms in the setting of quaternionic valued slice polyanalytic functions. In particular, using the polyanalytic Fueter mappings it is possible to construct a new family of polynomials which…
By replacing the spatial derivative with the Dunkl derivative, we generalize the Fokker-Planck equation in (1+1) dimensions. We obtain the Dunkl-Fokker-Planck eigenvalues equation and solve it for the harmonic oscillator plus a…
In this work we introduce two different generalizations of the Fokker-Planck equation in (1+1) dimensions by replacing the spatial derivatives in terms of generalized Dunkl-type derivatives involving reflection operators. As applications of…
Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…
The main goal of this paper is to generalize Bohr's phenomenon from complex one-dimensional analysis to higher dimensions in the framework of Quaternionic Analysis.
In this paper we generalize the result on Fueter's theorem from [10] by Eelbode et al. to the case of monogenic functions in biaxially symmetric domains. To obtain this result, Eelbode et al. used representation theory methods but their…
Dunkl theory is a far reaching generalization of Fourier analysis and special function theory related to root systems. During the sixties and seventies, it became gradually clear that radial Fourier analysis on rank one symmetric spaces was…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
In this paper we present a generalization of the classical Hermite polynomials to the framework of Clifford-Dunkl operators. Several basic properties, such as orthogonality relations, recurrence formulae and associated differential…
We prove the following generalisation of Bohr theorem : let $K\subset\mathbb C$ a continuum, $(F_n)_n$ its Faber polynomials, $\Omega_R=\{\Phi_K<R\}, (R>1)$ the levels sets of the Green function; then there exists $R_0>1$ such that for any…
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…
In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…