Related papers: q-Fourier Transform and its inversion-problem
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum…
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…
In this paper we prove that the non-linear Fourier transform of the defocusing NLS equation on the circle is linear up to terms which are one order smoother.
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
While several instances of shifted convolution problems for GL(3) x GL(2) have been solved, the case where one factor is the classical divisor function and one factor is a GL(3) Fourier coefficient has remained open. We solve this case in…
The $q$-calculus is reformulated in terms of the umbral calculus and of the associated operational formalism. We show that new and interesting elements emerge from such a restyling. The proposed technique is applied to a different…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
This paper aims to study the $q$-wavelet and the $q$-wavelet transforms, associated with the $q$-Bessel operator for a fixed $q\in ]0, 1[$. As an application, an inversion formulas of the $q$-Riemann-Liouville and $q$-Weyl transforms using…
A mathematical relation between elements of one- and multi-dimensional discrete Fourier transforms (DFT) is found. A method of analysing the multi-dimensional data by their single one-dimensional (1-D) DFT is offered. An experiment of…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
In this paper we propose a definition and construction of a new family of one-way candidate functions ${\cal R}_N:Q^N \to Q^N$, where $Q=\{0,1,...,s-1\}$ is an alphabet with $s$ elements. Special instances of these functions can have the…
The validity of (1-q) expansion and factorization approximations are analysed in the framework of Tsallis statistics. We employ exact expressions for classical independent systems (harmonic oscillators) by considering the unnormalized and…
In this paper we study the variance of the Euler totient function (normalized to $\varphi(n)/n$) in the integers $\mathbb{Z}$ and in the polynomial ring $\mathbb{F}_q[T]$ over a finite field $\mathbb{F}_q$. It turns out that in…
The two-sided quaternion Fourier transform satisfies some uncertainty principles similar to the Euclidean Fourier transform. A generalization of Beurling's theorem, Hardy, Cowling-Price and Gelfand-Shilov theorems, is obtained for the…
On a cyclic group of prime order, the non-trivial Dirichlet characters together with their Fourier transforms have constant modulus outside 0 and vanish at 0. Answering a question of H. Cohn, we construct new functions with these…
The inverse problem of X-tray transforms considers reconstructing functions from some data that are easier to measure, which is typically the integral of that function along geodesics. We prove that if the domain has a foliation structure,…
In this paper we show an alternative way of defining Fourier Series and Transform by using the concept of convolution with exponential signals. This approach has the advantage of simplifying proofs of transforms properties and, in our view,…