相关论文: NMR experiment factors numbers with Gauss sums
Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…
Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, the source signals…
We obtain an estimate for the main term of the counting function for numerical monoids.
We prove some special cases of Bergeron's inequality involving two Gaussian polynomials (or $q$-binomials).
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…
We report on prime number decomposition by use of the Talbot effect, a well-known phenomenon in classical near field optics whose description is closely related to Gauss sums. The latter are a mathematical tool from number theory used to…
The aim of this note is to provide a new identity connected with the Gauss hypergeometric function. This is achieved using results of certain combinatorial identities and a hypergeometric function approach.
We study statistical properties of an NP-complete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NP-complete problem and…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
Mixture models are among the most popular tools for clustering. However, when the dimension and the number of clusters is large, the estimation of the clusters become challenging, as well as their interpretation. Restriction on the…
Neural Gas (NG) constitutes a very robust clustering algorithm given euclidian data which does not suffer from the problem of local minima like simple vector quantization, or topological restrictions like the self-organizing map. Based on…
We draw attention to various aspects of number theory emerging in the time evolution of elementary quantum systems with quadratic phases. Such model systems can be realized in actual experiments. Our analysis paves the way to a new,…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transforming the k-bit coupling ($k\geq 3$) terms to quadratic terms…
We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.
We prove that for almost all $N$ there is a sum of four fourth powers in the interval $(N-N^\gamma,N]$, for all $\gamma>4059/16384=0.24774..$.
Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…