Related papers: On the Replica Fourier Transform
The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and…
We formulate a notion of group Fourier transform for a finite dimensional Lie group. The transform provides a unitary map from square integrable functions on the group to square integrable functions on a non-commutative dual space. We then…
A recursion formula is derived which allows to evaluate invariant integrals over the orthogonal group O(N), where the integrand is an arbitrary finite monomial in the matrix elements of the group. The value of such an integral is…
Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…
We consider the minimal representation of the adjoint split group $E_7$ over a p-adic field. The representation has a model in a space of functions on a 17 dimensional cone $\Omega$, and elements of the unique parabolic subgroup Q with…
The purpose of this paper is to obtain Fourier transforms of multivariate orthogonal polynomials on the cone such as Laguerre polynomials on the cone and Jacobi polynomials on the cone and to define two new families of multivariate…
Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…
Image reconstruction is likely the most predominant auxiliary task for image classification, but we would like to think twice about this convention. In this paper, we investigated "approximating the Fourier Transform of the input image" as…
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
It is well-known that a complex circulant matrix can be diagonalized by a discrete Fourier matrix with imaginary unit $\mathtt{i}$. The main aim of this paper is to demonstrate that a quaternion circulant matrix cannot be diagonalized by a…
This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
In this work we define operator-valued Fourier transforms for suitable integrable elements with respect to the Plancherel weight of a (not necessarily Abelian) locally compact group. Our main result is a generalized version of the Fourier…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
The $p$-adic $q$-integral (= $I_q$-integral) was defined by author in the previous paper [1, 3]. In this paper, we consider $I_q$-Fourier transform and investigate some properties which are related to this transform.
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a…
This paper presents a family of Fourier eigenfunctions indexed by the space dimension d. These eigenfunctions are radial and built upon some generalized exponential integral function. For d=1,2,3, they are integrable or square integrable…
A q-version of the Fourier transformation and some of its properties are discussed.