Related papers: Kummer surfaces for primality testing

This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the \emph{Jackson algebra}, that will be used in sequels to this paper to study non-commutative arithmetic…

This work is a probabilistic study of the 'primes' of the Cram\'er model. We prove that there exists a set of integers $\mathcal S$ of density 1 such that \begin{equation}\liminf_{ \mathcal S\ni n\to\infty} (\log n)\mathbb{P} \{S_n\…

Divisibility tests are algorithms that can quickly decide if one integer is divisible by another. There are many tests but most are either of the trimming or summing variety. Our goals are to present Zbikowski's family of trimming tests as…

We introduce an algorithm to compute the rational torsion subgroup of the Jacobian of a hyperelliptic curve of genus 3 over the rationals. We apply a Magma implementation of our algorithm to a database of curves with low discriminant due to…

We construct locally recoverable codes with hierarchy from surfaces in $\mathbb{A}^3$ admitting a fibration by curves of Artin-Schreier or Kummer type. We derive the parameters of our codes by leveraging the geometry and arithmetic of the…

We recast elliptic surfaces over the projective line in terms of the non-commutative tori and one-parameter families of the periodic continued fractions. The correspondence is used to study the Picard numbers, the ranks and the minimal…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by…

We compute the integer cohomology rings of the ``polygon spaces'' introduced in [Hausmann,Klyachko,Kapovich-Millson]. This is done by embedding them in certain toric varieties; the restriction map on cohomology is surjective and we…

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…

An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

Physically meaningful periodic solutions to certain integrable partial differential equations are given in terms of multi-dimensional theta functions associated to real Riemann surfaces. Typical analytical problems in the numerical…

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…

Let $H(n) = \prod_{p|n}\frac{p}{p-1}$ where $p$ ranges over the primes which divide $n$. It is well known that if $n$ is a primitive non-deficient number, then $H(n) > 2$. We examine inequalities of the form $H(n)> 2 + f(n)$ for various…

We construct K3 surfaces over number fields that have good reduction everywhere. These do not exists over the rational numbers, by results of Abrashkin and Fontaine. Our surfaces exist for three quadratic number fields, and an infinite…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

We use methods for computing Picard numbers of reductions of K3 surfaces in order to study the decomposability of Jacobians over number fields and the variance of Mordell-Weil ranks of families of Jacobians over different ground fields. For…