Abstract: In this paper, we investigate the popular Miller–Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of primality witnesses for composite and prime integers. Let W ( n ) denote the set of all primality witnesses for odd n. By Rabin’s theorem, if n is prime, then each positive integer a < n is a primality witness for n. For composite n, the power of W ( n ) is less than or equal to φ ( n ) / 4 where φ ( n ) is Euler’s Totient function. We derive new exact formulas for the power of W ( n ) depending on the number of factors of tested integers. In addition, we study the average probability of errors in the Miller–Rabin test and show that it decreases when the length of tested integers increases. This allows us to reduce estimations for the probability of the Miller–Rabin test errors and increase its efficiency.

Abstract: Let $p$ be a prime number. We prove that the $P=W$ conjecture for $\mathrm{SL}_p$ is equivalent to the $P=W$ conjecture for $\mathrm{GL}_p$. As a consequence, we verify the $P=W$ conjecture for genus 2 and $\mathrm{SL}_p$. For the proof, we compute the perverse filtration and the weight filtration for the variant cohomology associated with the $\mathrm{SL}_p$-Hitchin moduli space and the $\mathrm{SL}_p$-twisted character variety, relying on Grochenig-Wyss-Ziegler's recent proof of the topological mirror conjecture by Hausel-Thaddeus. Finally we discuss obstructions of studying the cohomology of the $\mathrm{SL}_n$-Hitchin moduli space via compact hyper-Kahler manifolds.

Abstract: We use Macaulay2 for several enriched counts in GW(k). First, we compute the count of lines on a general cubic surface using Macaulay2 over Fp in GW(Fp) for p a prime number and over the rational numbers Q in GW(Q). This gives a new proof for the fact that the count of lines on a cubic surface is 3+12h in GW(k) where h denotes the hyperbolic form. Then, we compute the count of lines in P3 meeting 4 general lines, the count of lines on a quadratic surface meeting one general line and the count of singular elements in a pencil of degree d-surfaces. Finally, we provide code to compute the EKL-form and compute several A1-Milnor numbers.

Abstract: In 2011, Fang et al. in (J. Combin. Theory A 118 (2011) 1039-1051) posed the following problem: Classify non-normal locally primitive Cayley graphs of finite simple groups of valency $d$, where either $d\leq 20$ or $d$ is a prime number. The only case for which the complete solution of this problem is known is of $d=3$. Except this, a lot of efforts have been made to attack this problem by considering the following problem: Characterize finite nonabelian simple groups which admit non-normal locally primitive Cayley graphs of certain valency $d\geq4$. Even for this problem, it was only solved for the cases when either $d\leq 5$ or $d=7$ and the vertex stabilizer is solvable. In this paper, we make crucial progress towards the above problems by completely solving the second problem for the case when $d\geq 11$ is a prime and the vertex stabilizer is solvable.

Abstract: The maximal prime gaps upper bound problem is one of the major mathematical problems to date. The objective of the current research is to develop a standard which will aid in the understanding of the distribution of prime numbers. This paper presents theoretical results which originated with a researchin the subject of the maximal prime gaps. the document presents the sharpest upper bound for the maximal prime gaps ever developed. The result becomes the Supremum bound on the maximal prime gaps and subsequently culminates with the conclusive proof of the Firoozbakht's Hypothesis No 30. Firoozbakht's Hypothesis implies quite a bold conjecture concerning the maximal prime gaps. In fact it imposes one of the strongest maximal prime gaps bounds ever conjectured. Its truth implies the truth of a greater number of known prime gaps conjectures, simultaneously, the Firoozbakht's Hypothesis disproves a known heuristic argument of Granville and Maier. This paper is dedicated to a fellow mathematician, the late Farideh Firoozbakht.

Abstract: We estimate the sums ∑n≤xΛ(n)f(n)g(n)exp(2iπϑn) and ∑n≤xμ(n)f(n)g(n)exp(2iπϑn), where Λ denotes the von Mangoldt function (and μ the Mobius function) whenever q1 and q2 are two coprime bases, f (resp., g) is a strongly q1-multiplicative (resp., strongly q2-multiplicative) function of modulus 1, and ϑ is a real number. The goal of this work is to introduce a new approach to study these sums involving simultaneously two different bases combining Fourier analysis, Diophantine approximation, and combinatorial arguments. We deduce from these estimates a prime number theorem (and Mobius orthogonality) for sequences of integers with digit properties in two coprime bases.

Abstract: Pierre de Fermat (1601/7–1665) is known as the inventor of modern number theory. He invented–improved many methods useful in this discipline. Fermat often claimed to have proved his most difficult theorems thanks to a method of his own invention: the infinite descent (Fermat 1891–1922, II, pp. 431–436). He wrote of numerous applications of this procedure. Unfortunately, he left only one almost complete demonstration and an outline of another demonstration. The outline concerns the theorem that every prime number of the form 4n + 1 is the sum of two squares. In this paper, we analyse a recent proof of this theorem. It is interesting because: (1) it follows all the elements of which Fermat wrote in his outline; (2) it represents a good introduction to all logical nuances and mathematical variants concerning this method of which Fermat spoke. The assertions by Fermat will also be framed inside their historical context. Therefore, the aims of this paper are related to the history of mathematics and to the logic of proof-methods.

Abstract: The Prime state of $n$ qubits, $|\mathbb{P}_n\rangle$, is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than $2^n$. This state encodes, quantum mechanically, arithmetic properties of the primes. We first show that the Quantum Fourier Transform of the Prime state provides a direct access to Chebyshev-like biases in the distribution of prime numbers. We next study the entanglement entropy of $|\mathbb{P}_n\rangle$ up to $n=30$ qubits, and find a relation between its scaling and the Shannon entropy of the density of square-free integers. This relation also holds when the Prime state is constructed using a qudit basis, showing that this property is intrinsic to the distribution of primes. The same feature is found when considering states built from the superposition of primes in arithmetic progressions. Finally, we explore the properties of other number-theoretical quantum states, such as those defined from odd composite numbers, square-free integers and starry primes. For this study, we have developed an open-source library that diagonalizes matrices using floats of arbitrary precision.

Abstract: We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power of the suitably normalized length of the interval regardless of how long or short the interval is. Such power-saving bounds are new even in the special case of the Mobius function. These general results are motivated by several applications. First, we strengthen work of Hooley on sums of two squares by establishing an asymptotic for the number of integers that are sums of two squares in almost all short intervals. Previously only the order of magnitude was known. Secondly, we extend this result to general norm forms of an arbitrary number field $K$ (sums of two squares are norm-forms of $\mathbb{Q}(i)$). Thirdly, Hooley determined the order of magnitude of the sum of $(s_{n + 1} - s_{n})^{\gamma}$ with $\gamma \in (1, 5/3)$ where $s_{1} < s_2 < \ldots$ denote integers representable as sums of two squares. We establish a similar results with $\gamma \in (1, 3/2)$ and $s_n$ the sequence of integers representable as norm-forms of an arbitrary number field $K$. This is the first such result for a number field of degree greater than two. Assuming the Riemann Hypothesis for all Hecke $L$-functions we also show that $\gamma \in (1,2)$ is admissible. Fourthly, we improve on a recent result of Heath-Brown about gaps between $x^{\varepsilon}$-smooth numbers. More generally, we obtain results about gaps between multiplicative sequences. Finally our result is useful in other contexts aswell, for instance in our forthcoming work on Fourier uniformity (joint with Terence Tao, Joni Teravainen and Tamar Ziegler).

Abstract: The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this coprime version of the Schinzel Hypothesis: under some natural assumption, coprime polynomials assume coprime values at infinitely many integers. Consequences include a version "modulo an integer" of the original Schinzel Hypothesis, with the Goldbach conjecture, again modulo an integer, as a special case.

Abstract: The Rivest-Shamir-Adleman (RSA) cryptosystem is one of the strong encryption approaches currently being used for secure data transmission over an insecure channel. The difficulty encountered in breaking RSA derives from the difficulty in finding a polynomial time for integer factorization. In integer factorization for RSA, given an odd composite number n, the goal is to find two prime numbers p and q such that n = p q. In this paper, we study several integer factorization algorithms that are based on Fermat’s strategy, and do the following: First, we classify these algorithms into three groups: Fermat, Fermat with sieving, and Fermat without perfect square. Second, we conduct extensive experimental studies on nine different integer factorization algorithms and measure the performance of each algorithm based on two parameters: the number of bits for the odd composite number n, and the number of bits for the difference between two prime factors, p and q. The results obtained by the algorithms when applied to five different data sets for each factor reveal that the algorithm that showed the best performance is the algorithms based on (1) the sieving of odd and even numbers strategy, and (2) Euler’s theorem with percentage of improvement of 44% and 36%, respectively compared to the original Fermat factorization algorithm. Finally, the future directions of research and development are presented.

Abstract: The occurrence and frequency of a phenomenon of resonance (namely the coalescence of some Dubrovin canonical coordinates) in the locus of Small Quantum Cohomology of complex Grassmannians is studied. It is shown that surprisingly this frequency is strictly subordinate and highly influenced by the distribution of prime numbers. Two equivalent formulations of the Riemann Hypothesis are given in terms of numbers of complex Grassmannians without coalescence: the former as a constraint on the disposition of singularities of the analytic continuation of the Dirichlet series associated to the sequence counting non-coalescing Grassmannians, the latter as asymptotic estimate (whose error term cannot be improved) for their distribution function.

Abstract: We construct infinite Galois extensions $K$ of $\mathbb{Q}$ that satisfy the Northcott property on elements of small height, and where this property can be deduced solely from the splitting behavior of prime numbers in $K$. We also give examples of Galois extensions of $\mathbb{Q}$ which have finite local degree at all prime numbers and do not satisfy the Northcott property.

Abstract: Let $p$ be an odd prime number. In this paper, we study the growth of the Sylow $p$-subgroups of the even $K$-groups of rings of integers in a $p$-adic Lie extension. Our results generalize previous results of Coates and Ji-Qin, where they considered the situation of a cyclotomic $\mathbb{Z}_p$-extension. Our method of proof differs from these previous work. Their proof relies on an explicit description of certain Galois group via Kummer theory afforded by the context of a cyclotomic $\mathbb{Z}_p$-extension, whereas our approach is via considering the Iwasawa cohomology groups with coefficients in $\mathbb{Z}_p(i)$ for $i\geq 2$. We should mention that this latter approach is possible thanks to the Quillen-Lichtenbaum Conjecture which is now known to be valid by the works of Rost-Voevodsky. We also note that the approach allows us to work with more general $p$-adic Lie extensions that do not necessarily contain the cyclotomic $\mathbb{Z}_p$-extension, where the Kummer theoretical approach does not apply. Along the way, we study the torsionness of the second Iwasawa cohomology groups with coefficients in $\mathbb{Z}_p(i)$ for $i\geq 2$. Finally, we give examples of $p$-adic Lie extensions, where the second Iwasawa cohomology groups can have nontrivial $\mu$-invariants.

Abstract: Let $N$ and $p$ be prime numbers $\geq 5$ such that $p$ divides $N-1$. Let $I$ be Mazur's Eisenstein ideal of level $N$ and $H_+$ be the plus part of $H_1(X_0(N), \mathbf{Z}_p)$ for the complex conjugation. We give a conjectural explicit description of the group $I\cdot H_+/I^2\cdot H_+$ in terms of the second $K$-group of the cyclotomic field $\mathbf{Q}(\zeta_N)$. We prove that this conjecture follows from a conjecture of Sharifi about some Eisenstein ideal of level $\Gamma_1(N)$. Following the work of Fukaya--Kato, we prove partial results on Sharifi's conjecture. This allows us to prove partial results on our conjecture.