相关论文: NMR experiment factors numbers with Gauss sums
We investigate the numerical approximation of integrals over $\mathbb{R}^d$ equipped with the standard Gaussian measure $\gamma$ for integrands belonging to the Gaussian-weighted Sobolev spaces $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed…
Using three coupled harmonic oscillators, we present an amplitude-amplification method for factorization of an integer. We generalize the method in [arXiv:1007.4338] by employing non-orthogonal measurements on the harmonic oscillator. This…
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…
In this paper, we propose a numerical method of computing a Hadamard finite-part integral with a non-integral power singularity at an endpoint, that is, a finite part of a divergent integral as a limiting procedure. In the proposed method,…
Integral representations of hypergeometric functions proved to be a very useful tool for studying their properties. The purpose of this paper is twofold. First, we extend the known representations to arbitrary values of the parameters and…
We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the…
Let $N$ be a positive number. We give an asymptotic formula for the sum of $\tau(\gcd(a,b))$ for all $a$ and $b$ with $ab \le N$.
Estimation of the number of components (or order) of a finite mixture model is a long standing and challenging problem in statistics. We propose the Group-Sort-Fuse (GSF) procedure -- a new penalized likelihood approach for simultaneous…
The main purpose of this paper is to study higher order moments of the generalized quadratic Gauss sums weighted by $L$-functions using estimates for character sums and analytic methods. We find asymptotic formulas for three character sums…
We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…
Gaussian Quadrature is a well known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums have found some new interest. In this paper we apply these ideas to…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
We propose a greedy variational method for decomposing a non-negative multivariate signal as a weighted sum of Gaussians, which, borrowing the terminology from statistics, we refer to as a Gaussian mixture model. Notably, our method has the…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
The coupled-cluster wave function factorizes to a very good approximation into a product of an intrinsic wave function and a Gaussian for the center-of-mass coordinate. The width of the Gaussian is in general not identical to the oscillator…
We investigate the sums $\sum_{n\le X, (n,q)=1}\frac{\mu(n)}{n^s}\log^k\left(\frac{X}{n}\right)$, where $k\in\{0,1\}$, $s\in\mathbb{C}$, $\Re s>0$. Our goal is to obtain explicit asymptotic estimations for these quantities. To achieve this,…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…
As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc. In this paper, an algorithm for nonnegative matrix…
We show that an apparently overlooked result of Euler from \cite{E421} is essentially equivalent to the general multiplication formula for the $\Gamma$-function that was proven by Gauss in \cite{Ga28}.