相关论文: NMR experiment factors numbers with Gauss sums

We introduce a new approximate multiresolution analysis (MRA) using a single Gaussian as the scaling function, which we call Gaussian MRA (GMRA). As an initial application, we employ this new tool to accurately and efficiently compute the…

We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…

Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let $\k$ be a primitive multiplicative character of order $N$ over finite field $\fq$. This paper studies the problem…

Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…

We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.

Let b $\ge$ 2 be an integer and let s b (n) denote the sum of the digits of the representation of an integer n in base b. For sufficiently large N , one has Card{n $\le$ N : |s 3 (n) -- s 2 (n)| $\le$ 0.1457205 log n} \textgreater{} N…

We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…

Prime factorization on quantum processors is typically implemented either via circuit-based approaches such as Shor's algorithm or through Hamiltonian optimization methods based on adiabatic, annealing, or variational techniques. While…

We consider multiple sums and multi-integrals as tau functions of the BKP hierarchy using neutral fermions as the simplest tool for deriving these. The sums are over projective Schur functions $Q_\alpha$ for strict partitions $\alpha$. We…

Let $m,r\in\mathbb{Z}$ and $\omega\in\mathbb{R}$ satisfy $0\leqslant r\leqslant m$ and $\omega\geqslant1$. Our main result is a generalized continued fraction for an expression involving the partial binomial sum $s_m(r) =…

The exponential and Gaussian functions are among the most fundamental and important operations, appearing ubiquitously throughout all areas of science, engineering, and mathematics. Whereas formally, it is well-known that any function may…

We completely classify the atomic summands in a graph product $(M,\varphi) = *_{v \in \mathcal{G}} (M_v,\varphi_v)$ of von Neumann algebras with faithful normal states. Each type I factor summand $(N,\psi)$ is a tensor product of type I…

In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.

This is a sequel to the paper [K. Fujii : SIGMA {\bf 7} (2011), 022, 12 pages]. In this paper we treat a non-Gaussian integral based on a quartic polynomial and make a mathematical experiment by use of MATHEMATICA whether the integral is…

We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

In this paper we study a group theoretical generalization of the well-known Gauss's formula that uses the generalized Euler's totient function introduced in [11].

We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research…

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

Let $R$ be a finite ring with unity, $\psi: R \to \mathbb{C}^\times$ be an additive character of $R$, and \( \chi_0 \) be the principal multiplicative character ($i.e.$, $\chi_0(x) = 1 \quad \text{for all } x \in R^\times$), then the Gauss…