Related papers: Three quick recipes with fully extended oriented 2…
The grand unification of flavor(GUF) in extra dimensions is discussed. After reviewing the old GUF, I present a GUF model SU(7) in 5D with the recently popular field theoretic orbifold compactification.
We revisit the classical Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. It has long been known that P3P can be reduced to a quartic polynomial with…
We derive a canonical form for 2-group gauge theory in 3+1D which shows they are either equivalent to Dijkgraaf-Witten theory or to the so-called "EF1" topological order of Lan-Wen. According to that classification, recently argued from a…
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…
This tutorial is designed to clarify a few misconceptions in the field of ultrafast optics. (1) Analytic signal that underlies the complex-conjugate decomposition of the field is discussed, as well as the misunderstanding between…
The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…
Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, important variants corresponding to \emph{nonabelian} groups…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…
QCD lattice simulations with 2+1 flavours (when two quark flavours are mass degenerate) typically start at rather large up-down and strange quark masses and extrapolate first the strange quark mass and then the up-down quark mass to its…
Many results from lattice QCD of broad importance to particle and nuclear physics are obtained with 2+1 flavors of staggered sea quarks. In the continuum limit, staggered fermions yield four species, called tastes. To reduce the number of…
We explain the orthogonal planes split (OPS) of quaternions based on the arbitrary choice of one or two linearly independent pure unit quaternions $f,g$. Next we systematically generalize the quaternionic Fourier transform (QFT) applied to…
The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…
These notes briefly discuss Fourier transforms of finite measures and extensions of Fourier integrals to points in complex domains.
Recently it was shown that in QCD-like theories with $N_f > N$, where $N_f$ is the number of light flavors and $N$ is the number of colors, there are correlation functions that vanish in perturbation theory and at short distances receive…
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces…
Using the existence of infinite numbers $k$ in the non-Archimedean ring of Robinson-Colombeau, we define the hyperfinite Fourier transform (HFT) by considering integration extended to $[-k,k]^{n}$ instead of $(-\infty,\infty)^{n}$. In order…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…