Related papers: Kummer surfaces for primality testing

We study constructing an algebraic curve from a Riemann surface given via a translation surface, which is a collection of finitely many polygons in the plane with sides identified by translation. We use the theory of discrete Riemann…

We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…

We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing…

We prove that a Kummer surface defined over a complete strictly Henselian discretely valued field $K$ of residue characteristic different from 2 admits a strict Kulikov model after finite base change. The Kulikov models we construct will be…

Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a…

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

Understanding and predicting the properties of solid-state materials from first-principles has been a great challenge for decades. Owing to the recent advances in quantum technologies, quantum computations offer a promising way to achieve…

The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm,…

This paper investigates prime and co-prime integer matrices and their properties. It characterizes all pairwise co-prime integer matrices that are also prime integer matrices. This provides a simple way to construct families of pairwise…

PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…

By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…

We explicitly construct the Kummer variety associated to the Jacobian of a hyperelliptic curve of genus 3 that is defined over a field of characteristic not equal to 2 and has a Weierstra{\ss} point defined over the same field. We also…

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.

In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…