Related papers: Kummer surfaces for primality testing
We give an asymptotic expression for the number of nonsingular integer n-by-n-matrices with primitive row vectors, determinant k, and Euclidean matrix norm less than T, for large T. We also investigate the density of matrices with primitive…
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
We compute equations for real multiplication on the divisor classes of genus two curves via algebraic correspondences. We do so by implementing van Wamelen's method for computing equations for endomorphisms of Jacobians on examples drawn…
The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the…
We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\equiv1\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\log_2(M)$…
We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…
Likelihood surfaces in the parameter space of gravitational wave signals can contain many secondary maxima, which can prevent search algorithms from finding the global peak and correctly mapping the distribution. Traditional schemes to…
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
Let $S$ be a smooth projective surface over $\mathbb{C}$ and $S^{[n]}$ be the Hilbert scheme of $n$ points over $S$, for any positive integer $n$. Let ${\bf a}=(n_1,\ldots,n_r)$ and ${\bf b}=(m_1,\ldots,m_s)$ be two distinct partitions of…
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines…
We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
In this paper, we study the algebraic rank and the analytic rank of the Jacobian of hyperelliptic curves $y^2 = x^5 + m^2$ for integers $m$. Namely, we first provide a condition on $m$ that gives a bound of the size of Selmer group and then…
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 construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…