Related papers: Failed attempt to disproof the Riemann Hypothesis
Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…
The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…
We present a novel approach to test the consistency of the cosmological models with multiband CMB data using a nonparametric approach. In our analysis we calibrate the REACT (Risk Estimation and Adaptation after Coordinate Transformation)…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
We improve the test to show the impossibility of a quantum theory based on real numbers by a larger ratio of complex-to-real bound on a Bell-type parameter. In contrast to previous theoretical and experimental proposals the test requires…
Randomized benchmarking and variants thereof, which we collectively call RB+, are widely used to characterize the performance of quantum computers because they are simple, scalable, and robust to state-preparation and measurement errors.…
Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize…
In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…
Do two data samples come from different distributions? Recent studies of this fundamental problem focused on embedding probability distributions into sufficiently rich characteristic Reproducing Kernel Hilbert Spaces (RKHSs), to compare…
We consider the Riesz and Hardy-Littlewood wave i.e. a ``critical function'' whose behaviour is concerned with the possible truth of the Riemann Hypothesis (RH). The function is studied numerically for the case alpha = 15/2 and beta = 4 in…
Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…
The Riemann hypothesis is one of the most famous unresolved problems in modern mathematics. The discussion here will present an overview of past methods that prove the Riemann hypothesis is a $\Pi_1^0$ sentence. We also end with some…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
Recent advances in Rate-Distortion-Perception (RDP) theory highlight the importance of balancing compression level, reconstruction quality, and perceptual fidelity. While previous work has explored numerical approaches to approximate the…
The Riemann Hypothesis is a conjecture that all non-trivial zeros of Riemann Zeta function are located on the critical line in the complex plane. Hundreds of propositions in function theory and analytic number theory rely on this…
We show that for every $k\in\mathbb{N}$ and $\varepsilon>0$, for large enough alphabet $R$, given a $k$-CSP with alphabet size $R$, it is NP-hard to distinguish between the case that there is an assignment satisfying at least…
We substantially apply the Li criterion for the Riemann hypothesis to hold. Based upon a series representation for the sequence \{\lambda_k\}, which are certain logarithmic derivatives of the Riemann xi function evaluated at unity, we…
This paper analyzes the scaling window of a random CSP model (i.e. model RB) for which we can identify the threshold points exactly, denoted by $r_{cr}$ or $p_{cr}$. For this model, we establish the scaling window…