Related papers: Prime Number Decomposition using the Talbot Effect
This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…
This paper introduces a general technique for estimating the absolute value of pure Gaussian sums of order k over a prime p for a class of composite order k. The new estimate improves the classical estimate by a factor of about 2 or better…
Gaussian processes are probabilistic models that are commonly used as functional priors in machine learning. Due to their probabilistic nature, they can be used to capture the prior information on the statistics of noise, smoothness of the…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We demonstrate the temporal Talbot effect for trapped matter waves using ultracold atoms in an optical lattice. We investigate the phase evolution of an array of essentially non-interacting matter waves and observe matter-wave collapse and…
This article investigates the Talbot effects in Fibonacci geometry by introducing the cut-and-project construction, which allows for capturing the entire infinite Fibonacci structure into a single computational cell. Theoretical and…
We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…
In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
In this paper we give an algorithm that calculates the skeleton of a tame covering of curves over a complete discretely valued field. The algorithm relies on the {{tame simultaneous semistable reduction theorem}}, for which we give a short…
Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…
In this paper, we study the problem of a batch of linearly correlated image alignment, where the observed images are deformed by some unknown domain transformations, and corrupted by additive Gaussian noise and sparse noise simultaneously.…
We experimentally demonstrate the Talbot effect resulting from the repeated self-reconstruction of a spatially intensity-modulated probe field under the Fresnel near-field regime. By launching the probe beam into an optically induced atomic…
Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…
This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…
Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…
q-Deformed harmonic oscillator algebra for real and root of unity values of the deformation parameter is discussed by using an extension of the number concept proposed by Gauss, namely the Q-numbers. A study of the reducibility of the Fock…
Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…
We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are…
Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also…