Related papers: Kummer surfaces for primality testing
We describe an algorithm for computing the Picard-Fuchs equation for a family of twists of a fixed elliptic surface. We then apply this algorithm to obtain the equation for several examples, which are coming from families of Kummer surfaces…
This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…
Finding Hemisystems is a challenging problem and just few examples arising from the Hermitian surface are known. A recent method to obtain Hemisystems is based on using maximal curves. Along this side of research, we provide new examples of…
We construct and study curves with low H-constants on abelian and K3 surfaces. Using the Kummer $(16_{6})$-configurations on Jacobian surfaces and some $(16_{10})$-configurations of curves on $(1,3)$-polarized Abelian surfaces, we obtain…
In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest…
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware,…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…
We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…
With the advent of near-term quantum computers, the simulation of properties of solids using quantum algorithms becomes possible. By an adequate description of the system's Hamiltonian, variational methods enable to fetch the band structure…
In this paper we use the orbital normal form of the nondegenerate Hopf-zero singularity to obtain necessary conditions for the existence of first integrals for such singularity. Also, we analyze the relation between the existence of first…
Testing convergence of infinite series is an important part of mathematics. A very basic test of convergence is to upper-bound a given series with a known series, term by term. In $19^{th}$ century, Kummer proposed a test of convergence for…
In this paper, we study the classical theory of quadratic line complexes and Kummer surfaces. A quadratic line complex is the intersection of the Grassmannian $G(2,4)$ and a quadric hypersurface in ${\bf P}^5$, and a Kummer surface is the…
Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality…