Related papers: NMR experiment factors numbers with Gauss sums
In this note, we firstly establish an extended Gauss's summation identity. Using this identity, we compute values of a family of $_4F_3$ hypergeometric functions, which generalize the results obtained by Ferretti et al..
We prove a general independent equidistribution result for Gauss sums associated to $n$ monomials in $r$ variable multiplicative characters over a finite field, which generalizes several previous equidistribution results for Gauss and…
Parameter estimation for model-based clustering using a finite mixture of normal inverse Gaussian (NIG) distributions is achieved through variational Bayes approximations. Univariate NIG mixtures and multivariate NIG mixtures are…
In this work, we introduce a highly efficient algorithm to address the nonnegative matrix underapproximation (NMU) problem, i.e., nonnegative matrix factorization (NMF) with an additional underapproximation constraint. NMU results are…
The non-perturbative {\it ab initio} calculations of infinite nuclear matter using In-Medium Similarity Renormalization Group (IMSRG) method is developed in this work, which enables calculations with chiral two and three-nucleon forces at…
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
A method for the evaluation of the epsilon expansion of multi-loop massless Feynman integrals is introduced. This method is based on the Gegenbauer polynomial technique and the expansion of the Gamma function in terms of harmonic sums.…
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation,…
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…
We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…
We prove a reciprocity formula between Gauss sums that is used in the computation of certain quantum invariants of 3-manifolds. Our proof uses the discriminant construction applied to the tensor product of lattices.
We introduce a method for non-uniform random number generation based on sampling a physical process in a controlled environment. We demonstrate one proof-of-concept implementation of the method that reduces the error of Monte Carlo…
In his notebooks, Gauss recorded various calculations with "infinite congruences". These infinite congruences are p-adic numbers; Gauss computes a square root of $5$ in the $11$-adic integers in order to find an $11$-adic approximation to a…
Particle flow Gaussian particle flow (PFGPF) uses an invertible particle flow to generate a proposal density. It approximates the predictive and posterior distributions as Gaussian densities. In this paper, we use bank of PFGPF filters to…
We present a fast Gauss transform in one dimension using nearly optimal sum-of-exponentials approximations of the Gaussian kernel. For up to about ten-digit accuracy, the approximations are obtained via best rational approximations of the…
Non-negative matrix factorization (NMF) and its variants have been widely employed in clustering and classification tasks (Long, & Jian , 2021). However, noises can seriously affect the results of our experiments. Our research is dedicated…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In this paper, we provide formulas for partial sums of weighted averages over regular integers modulo $n$ of the $\gcd$-sum function with any arithmetic function. Many interesting applications of the results are also given.