Related papers: Binary Discrete Fourier Transform and its Inversio…
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
Fourier-domain Difference Map (FDM) for phase retrieval with two oversampled coded diffraction patterns are proposed. FDM is a 3-parameter family of fixed point algorithms including Fourier-domain Hybrid-Projection-Reflection (FHPR) and…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
This article shows that any type of binary data can be defined as a collection from codewords of variable length. This feature helps us to define an Injective and surjective function from the suggested codewords to the required codewords.…
We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…
Using two distinct inversion techniques, the local one-dimensional potentials for the Riemann zeros and prime number sequence are reconstructed. We establish that both inversion techniques, when applied to the same set of levels, lead to…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
The number of zeros and the number of ones in a binary string are referred to as the composition of the string, and the prefix-suffix compositions of a string are a multiset formed by the compositions of the prefixes and suffixes of all…
Collective coordinates in a many-particle system are complex Fourier components of the particle density, and often provide useful physical insights. However, given collective coordinates, it is desirable to infer the particle coordinates…
Local Binary Descriptors are becoming more and more popular for image matching tasks, especially when going mobile. While they are extensively studied in this context, their ability to carry enough information in order to infer the original…
In this paper we describe all pairs of binary vectors $({\bf u}, {\bf v})$ such that the set of vectors obtained by $t$ deletions in ${\bf v}$ is a subset of the set of vectors obtained by $t$ deletions in ${\bf u}$ for $t=1,2$. Such pairs…
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…
The problem of recovering coefficients in a diffusion equation is one of the basic inverse problems. Perhaps the most important term is the one that couples the length and time scales and is often referred to as {\it the\/} diffusion…
Two (so-called left and right) variants of N-centered ensemble density-functional theory (DFT) [Senjean and Fromager, Phys. Rev. A 98, 022513 (2018)] are presented. Unlike the original formulation of the theory, these variants allow for the…
Nuclear density functional theory (DFT) is one of the main theoretical tools used to study the properties of heavy and superheavy elements, or to describe the structure of nuclei far from stability. While on-going efforts seek to better…
This paper introduces a novel binary stability property for voting rules-called binary self-selectivity-by which a society considering whether to replace its voting rule using itself in pairwise elections will choose not to do so. In…
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie…
We determine the possible masses and radii of the progenitors of white dwarfs in binaries from fits to detailed stellar evolution models and use these to reconstruct the mass-transfer phase in which the white dwarf was formed. We confirm…
The nonuniform discrete Fourier transform (NUDFT) and its inverse are widely used in various fields of scientific computing. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method…
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…