Related papers: Erratum to "Computation of maximal projection cons…
We investigate the relationship between the maximum of the zeta function on the 1-line and the maximal order of $S(t)$, the error term in the number of zeros up to height $t$. We show that the conjectured upper bounds on $S(t)$ along with…
We report an error found during independent review of the NuTauSim publicly available code \url{https://github.com/harmscho/NuTauSim} that forms the basis of this publication. The error in the code was in tracking the density of the medium…
In 2008 I thought I found a proof of the Riemann Hypothesis, but there was an error. In the Spring 2020 I believed to have fixed the error, but it cannot be fixed. I describe here where the error was. It took me several days to find the…
In Theorem 1 of the paper [V. Pata, A fixed point theorem in metric spaces, J. Fixed Point Theory Appl., 10 (2011), 299-305] it is proved that Picard's iterates for a function converge to a fixed point if a certain condition (C) is verified…
We consider the setting of online logistic regression and consider the regret with respect to the 2-ball of radius B. It is known (see [Hazan et al., 2014]) that any proper algorithm which has logarithmic regret in the number of samples…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
Functional principal component regression (PCR) can fail to provide good prediction if the response is highly correlated with some excluded functional principal component(s). This situation is common since the construction of functional…
In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed and convex set constraints. We show that the resulting…
Which classes can be learned properly in the online model? -- that is, by an algorithm that at each round uses a predictor from the concept class. While there are simple and natural cases where improper learning is necessary, it is natural…
We address two errors made in our paper arXiv:1511.03423. The most significant error is in Theorem 1.1. We repair this error, and show that the main result, Theorem 2.5 of arXiv:1511.03423, is true. The second error is in one of our…
We correct the statements and proofs of the (auxiliary) Propositions 4.1 and 4.2 of our paper `Evaluation of motivic functions, non-nullity, and integrability in fibers' in Advances in Mathematics, Vol. 409, Part A, Paper No. 108635, 29…
We conjecture the true rate of growth of the maximum size of the Riemann zeta function and other $L$-functions. We support our conjecture using arguments from random matrix theory, conjectures for moments of $L$-functions, and also by…
In [1] we highlighted the fact that the log polynomial expansion employed in Nature Astron. 3, no.3, 272-277 (2019) [2] is a poor approximation to flat $\Lambda$CDM, so using it to infer deviations from flat $\Lambda$CDM is not…
This note corrects a discrepancy between the semantics and the algorithm of the multiple until operator of CSL, like in Pr_{> 0.0025} (a until[1,2] b until[3,4] c), of the article: Model-checking continuous-time Markov chains by Aziz,…
In this paper has been withrawn by the author due the error in the proof of theoem 1.
Theorem 6.1.1 of [H.A.H.A.] on the existence of a model structure on the category of operads is not valid in the generality claimed. We present here a counter-example (due to B. Fresse) and a corrected version of the theorem.
In healthcare applications, predictive uncertainty has been used to assess predictive accuracy. In this paper, we demonstrate that predictive uncertainty estimated by the current methods does not highly correlate with prediction error by…
First, a misconception about the spectrum of a confined particle is evidentiated. Then, the results are shown to be incorrect by means of a counter-example, an explicit preparation for the probe is given that yields an arbitrary…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…
It has been the standard teaching of today that backward stability analysis is taught as absolute, just as in Newtonian physics time is taught absolute time. We will prove it is not true in general. It depends on algorithms. We will prove…