Related papers: Reasoning about Primes (I)
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
Let X be a complex algebraic manifold of dimension n+1 embedded in a sufficiently higher dimensional complex projective space, and Y a generic hyperplane section of X. We describe the mixed Hodge structure on H^p(X-Y,C) and the Hodge…
We provide a simple and efficient numerical criterion to verify the Iwasawa main conjecture and the indivisibility of derived Kato's Euler systems for modular forms of weight two at any good prime under mild assumptions. In the ordinary…
The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…
We prove the Goldbach Conjecture using p-adic analysis and algebraic methods, requiring no knowledge of prime gaps or distribution by showing counterexamples exist if and only if certain polynomials have integer solutions. Assuming, for the…
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
This paper analyzes the emergence and distribution of potential twin primes, pairs of integers that are both relatively prime to the first n primes or to a given set M of primes, and which are the breeding grounds of true twin primes. It…
We derive an algorithm to produce explicit formulas for certain generating functions of double Hurwitz numbers. These formulas generalize a formula of Goulden, Jackson and Vakil for one part double Hurwitz numbers. Immediate consequences…
Sierpinski's Hypothesis H1, formulated in 1958, is the conjecture that (provided $n\geq 2$), when the first $n^2$ counting numbers, $1, 2,3,\dots n^2$, are arranged in a square, then each row contains at least one prime. This conjecture is…
Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
The prime detecting function (PDF) approach can be effective instrument in the investigation of numbers. The PDF is constructed by recurrence sequence - each successive prime adds a sieving factor in the form of PDF. With built-in prime…
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…
Yoshida's Conjecture formulated by H. Yoshida in 1989 states that in $\mathbb{C}^{2N}$ equipped with the canonical symplectic form $\mathrm{d}\mathbf{p} \wedge \mathrm{d} \mathbf{q},$ the Hamiltonian flow corresponding to the Hamiltonian…
We give an equivalent form of the Twin prime conjecture relating to a symmetric property that is observed for terms present in a certain sequence of arithmetic progressions defined for a pair of co-prime integers.
We give an elementary introduction, through illustrative examples but without proofs, to one of the basic consequences of the Langlands programme, namely the law governing the primes modulo which a given irreducible integral polynomial…
In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…
We investigate the Hurwitz existence problem from a computational viewpoint. Leveraging the symmetric-group algorithm by Zheng and building upon implementations originally developed by Baroni, we achieve a complete and non-redundant…
We show that manifolds which parameterize values of first integrals of integrable finite-dimensional bihamiltonian systems carry a geometric structure which we call a {\em Kronecker web}. We describe two functors between Kronecker webs and…