Related papers: Close encounters among the primes
The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…
We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second…
This paper has been withdrawn by the author; a revised version is part of the author's phd-thesis "Quasi-logarithmic structures" (Zurich, 2007).
For $x\ge y>1$ and $u:= \log x/\log y$, let $\Phi(x,y)$ denote the number of positive integers up to $x$ free of prime divisors less than or equal to $y$. In 1950 de Bruijn [1] studied the approximation of $\Phi(x,y)$ by the quantity…
A new Goodman-Sharma type modification of the Meyer-K\"{o}nig and Zeller operator for approximation of bounded continuous functions on [0,1) is presented. We estimate the approximation error of the proposed operator and prove direct and…
We prove that the primes of the form $x^2+y^2+1$ contain arbitrarily long non-trivial arithmetic progressions.
We address a question posed by Ono, prove a general result for powers of an arbitrary prime, and provide an explanation for the appearance of higher congruence moduli for certain small primes. One of our results coincides with a recent…
A key goal in the design of probabilistic inference algorithms is identifying and exploiting properties of the distribution that make inference tractable. Lifted inference algorithms identify symmetry as a property that enables efficient…
We show that very clear answers to the queries raised by D. Chen and R. Ni in their Comment on our recent paper [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] can be found in our original paper already. The paper [A. Zaccone, Phys. Rev.…
In earlier work, we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an oracle separating the decision versions would follow from what we called the Generalized Linial-Nisan (GLN)…
The main purpose of this paper is to correct an error in the previously submitted version [*] := arXiv:2004.13749v1. [*] had been already accepted for publication in a scientific journal, but withdrawn by the author after the discovery of…
The FC-Gram trigonometric polynomial approximation of a non-periodic function that interpolates the function on equispaced grids was introduced in 2010 by Bruno and Lyon [J. Comput. Phys, 229(6):2009-2033, 2010]. Since then, the…
In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures -…
Gradients have been exploited in proposal distributions to accelerate the convergence of Markov chain Monte Carlo algorithms on discrete distributions. However, these methods require a natural differentiable extension of the target discrete…
Leader election between n parties is known to be impossible classically. This work gives a simple algorithm that does it, based on the weak coin flipping protocol with arbitrarily small bias derived by Mochon in 2007, and recently published…
In a prequel to this paper \cite{curvature1} a notion of curvature on the integers was introduced, based on the technique of "analytic continuation between primes", introduced in \cite{laplace}. In this paper, which is essentially…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…
In [5] the authors suggested a new algorithm for the numerical approximation of a BSDE by merging the cubature method with the first order discretization developed by [3] and [16]. Though the algorithm presented in [5] compared…
The content of this paper is now available as part of arXiv:0802.2019
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…