Related papers: Three quick recipes with fully extended oriented 2…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We study in detail two families of $q$-Fibonacci polynomials and $q$-Lucas polynomials, which are defined by non-conventional three-term recurrences. They were recently introduced by Cigler and have been then employed by Cigler and Zeng to…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
Whilst cooking is a very important human activity, there has been little consideration given to how we can formalize recipes for use in a reasoning framework. We address this need by proposing a graphical formalization that captures the…
In this paper, we begin constructing a new finite-dimensional topological quantum field theory (TQFT) for three-manifolds, based on group PSL(2,C) and its action on a complex variable by fractional-linear transformations, by providing its…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
The aim of this short note is to provide a very simple proof for obtaining the fundamental two-term transformation for the series ${}_3F_2(1)$ due to Thomae.
A numerical recipe is given for obtaining the density image of an initially compact quantum mechanical wavefunction that has expanded by a large but finite factor under free flight. The recipe given avoids the memory storage problems that…
We propose a simple physical implementation of the quantum Householder reflection (QHR) M(v)=I-2|v><v| in a quantum system of N degenerate states (forming a qunit) coupled simultaneously to an ancillary (excited) state by N resonant or…
Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…
Convolutional neural network (CNN) is one of the most widely-used successful architectures in the era of deep learning. However, the high-computational cost of CNN still hampers more universal uses to light devices. Fortunately, the Fourier…
Formal proofs are challenging to write even for experienced experts. Recent progress in Neural Theorem Proving (NTP) shows promise in expediting this process. However, the formal corpora available on the Internet are limited compared to the…
We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the…
This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast…
This comprehensive review paper delves into the intricacies of advanced Fourier type integral transforms and their mathematical properties, with a particular focus on fractional Fourier transform (FrFT), linear canonical transform (LCT),…
A discrete Fourier analysis associated with translation lattices is developed recently by the authors. It permits two lattices, one determining the integral domain and the other determining the family of exponential functions. Possible…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
We construct a new class of three-dimensional topological quantum field theories (3d TQFTs) by considering generalized Argyres-Douglas theories on $S^1 \times M_3$ with a non-trivial holonomy of a discrete global symmetry along the $S^1$.…
We develop number theoretic tools that allow to perform computations relevant for the quantum mechanics over finite fields of arbitrary, odd size, with the same speedup that is enjoyed by the Fast Fourier Transform.