Related papers: Kummer surfaces for primality testing
We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…
Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…
We study surfaces constructed from groups of units in quaternion orders $\Lambda$ over the integers in real quadratic fields k. A short presentation of some general theory of such surfaces is given, in particular, we construct certain…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
In this paper, we present an improved methodology to compute $\omega$-invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a…
As is well-known, there exist nonconstant holomorphic maps from the plane into the Riemann sphere $\PP^1$ minus two points, the simplest example of which is an explicit realization of the uniformization map given by applying the exponential…
In 2000, Galbraith and McKee heuristically derived a formula that estimates the probability that a randomly chosen elliptic curve over a fixed finite prime field has a prime number of rational points. We show how their heuristics can be…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
We construct two pencils of bielliptic curves of genus three and genus five. The first pencil is associated with a general abelian surface with a polarization of type $(1,2)$. The second pencil is related to the first by an unramified…
An automated treatment of iterated integrals based on letters induced by real-valued quadratic forms and Kummer--Poincar\'e letters is presented. These quantities emerge in analytic single and multi--scale Feynman diagram calculations. To…
Current methods for verifying quantum computers are predominately based on interactive or automatic theorem provers. Considering that quantum computers are dynamical in nature, this paper employs and extends the concepts from the…
Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set $A \subset [0, 1]^n$. Specifically, they gave a randomized algorithm such that if $A$'s surface area is less than $S$ then the algorithm will…
We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…
The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…
A conjecture by Corvaja and Zannier predicts that smooth, projective, simply connected varieties over a number field with Zariski dense set of rational points have the Hilbert Property; this was proved by Demeio for Kummer surfaces which…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
An observer-based Hamiltonian identification algorithm for quantum systems is proposed. For the 2-level case an exponential convergence result based on averaging arguments and some relevant transformations is provided. The convergence for…
We implement a quantum protocol for prime number identification based on entanglement dynamics, using IBM quantum processors. The method links the primality of an integer to specific Fourier components extracted from the time evolution of…