Related papers: A Fourier-invariant method for locating point-mass…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…
A quantum mechanical observer might be describable as having a reference system that is a superposition of classical inertial reference frames. The present paper suggests a possible weighting function in such superpositions, determined by…
In the Super-Transition-Array statistical method for the computation of radiative opacity of hot dense matter, the moments of the absorption or emission features involve partition functions with reduced degeneracies, occurring through the…
This paper deals with state estimation of stochastic models with linear state dynamics, continuous or discrete in time. The emphasis is laid on a numerical solution to the state prediction by the time-update step of the grid-point-based…
Traditional nonnegative matrix factorization (NMF) learns a new feature representation on the whole data space, which means treating all features equally. However, a subspace is often sufficient for accurate representation in practical…
For the first time, complete source distributions for the emission and absorption of acoustic and electromagnetic wavelets are defined and computed, both in spacetime and Fourier space. The biggest surprise is the great simplicity of the…
The problem of imaging of a moving target is formulated as a Coefficient Inverse Problem for a hyperbolic equation with its coefficient depending on all three spatial variables and time. As the initial condition, the point source running…
Higher order cumulants of point processes, such as skew and kurtosis, require significant computational effort to calculate. The traditional counts-in-cells method implicitly requires a large amount of computation since, for each sampling…
We describe a method for deriving the position and flux of point and compact sources observed by a scanning survey mission. Results from data simulated to test our method are presented, which demonstrate that at least a 10-fold improvement…
The Fourier transform of two-point momentum-space Feynman integrals with massless propagators and two off-shell legs can be used to prove identities between their periods, exemplified by the glue-and-cut identity. We generalize this…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
We demonstrate and characterize an experimental technique to directly image the momentum distribution of a strongly interacting two-dimensional quantum gas with high momentum resolution. We apply the principles of Fourier optics to…
Joint analyses of the large-scale distribution of galaxies, and their motions under the gravitational influence of this density field, allow powerful tests of the cosmological model, including measurement of the growth rate of cosmic…
Any object on earth has two fundamental properties: it is finite, and it is made of atoms. Structural information about an object can be obtained from diffraction amplitude measurements that account for either one of these traits.…
In order to study structure of the crust in neutron stars, we develop a finite-temperature Skyrme-Hartree-Fock method in the full three-dimensional coordinate space using the Fermion operator expansion method. It provides us with a possible…
This paper studies algorithms for efficiently computing Brascamp-Lieb constants, a task that has recently received much interest. In particular, we reduce the computation to a nonlinear matrix-valued iteration, whose convergence we analyze…
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…
This paper introduces a new clustering technique, called {\em dimensional clustering}, which clusters each data point by its latent {\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point.…
A novel nonparametric clustering algorithm is proposed using the interpoint distances between the members of the data to reveal the inherent clustering structure existing in the given set of data, where we apply the classical nonparametric…
We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error. This transform, which maps basis…