Related papers: Krawtchouk transforms and Convolutions
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the…
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…
Ordinary differential equations have an arithmetic analogue in which functions are replaced by numbers and the derivation operator is replaced by a Fermat quotient operator. In this survey we explain the main motivations, constructions,…
The aim of this paper is to derive (by using two operators, representable by a Jacobi matrix) a family of q-orthogonal polynomials, which turn to be dual to alternative q-Charlier polynomials. A discrete orthogonality relation and a…
We analyze the parabolic Dirac operator $D \pm i\partial_t$ in a biquaternionic setting, characterizing its kernel via generalized div-curl systems and Cauchy-Riemann-type relations between the real and imaginary parts. Using the machinery…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
We consider algebras acting on Schur and Q-Schur polynomials, corresponding to Kadomtsev-Petviashvili (KP) and BKP hierarchies. We present them in the spirit of affine Yangians, paying special attention to commutative subalgebras, box…
This article presents a convenient approach to Fourier analysis for the investigation of functions and distributions defined in $\mathbb{T}^m \times \mathbb{R}^n$. Our approach involves the utilization of a mixed Fourier transform,…
In this paper, estimates are proven for convolution kernels associated to multipliers from a reasonably general class of compactly supported two-dimensional functions constructed out of real-analytic functions. These estimates are both for…
An analytical approach to convolution of functions, which appear in perturbative calculations, is discussed. An extended list of integrals is presented.
We propose an alternative definition for a Tsallis entropy composition-inspired Fourier transform, which we call "$\tau_q$-Fourier transform". We comment about the underlying "covariance" on the set of algebraic fields that motivates its…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
Fast Fourier Transform (FFT) libraries are widely used for evaluating discrete convolutions. Most FFT implementations follow some variant of the Cooley-Tukey framework, in which the transform is decomposed into butterfly operations and…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
Many possible definitions have been proposed for fractional derivatives and integrals, starting from the classical Riemann-Liouville formula and its generalisations and modifying it by replacing the power function kernel with other kernel…
We derive formulas which connect cumulants of particle numbers observed with efficiency losses with the original ones based on the binomial model. These formulas can describe the case with multiple efficiencies in a compact form. Compared…
This book is an introduction to the nascent field of Fourier analysis on polytopes, and cones. There is a rapidly growing number of applications of these methods, so it is appropriate to invite students, as well as professionals, to the…
We describe two new combinatorial algorithms (using the language of "triangular arrays") for computing the Fourier transforms of simple perverse sheaves on the moduli space of representations of an equioriented quiver of type A. (A rather…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…