Related papers: An error estimate for counting $S_3$-sextic number…

The first result of our article is another proof of Mertens' third theorem in the number field setting, which generalises a method of Hardy. The second result concerns the sign of the error term in Mertens' third theorem. Diamond and Pintz…

Nested sampling (NS) is a popular algorithm for Bayesian computation. We investigate statistical errors in NS both analytically and numerically. We show two analytic results. First, we show that the leading terms in Skilling's expression…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

Motivated by recent results, we study sums of the form $S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor \right)$, where $f$ is an arithmetic function and $\left\lfloor\cdot\right\rfloor$ denotes the greatest integer…

We treat low-energy $^3$He-$\alpha$ elastic scattering in an Effective Field Theory (EFT) that exploits the separation of scales in this reaction. We compute the amplitude up to Next-to-Next-to-Leading Order (NNLO), developing a hierarchy…

In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…

We point out that several terms in the third-order corrections to the slow-roll power spectra presented by Ballardini et al. [1] are incorrect. The authors of that work claim that their result differ from the ones originally presented by…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

We give a substantial improvement for the error term in the asymptotic formula for the smallest parts function $\mathrm{spt}(n)$ of Andrews. Our methods depend on an explicit bound for sums of Kloosterman sums of half integral weight on the…

From the climate system to the effect of the internet on society, chaotic systems appear to have a significant role in our future. Here a method of statistical learning for a class of chaotic systems is described along with underlying…

The empirical Bayes estimators in mixed models are useful for small area estimation in the sense of increasing precision of prediction for small area means, and one wants to know the prediction errors of the empirical Bayes estimators based…

This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…

Using the analysis of ChPT to two loops, we perform an error analysis of the threshold and low energy parameters, based on the uncertainties for the one loop low energy parameters and the resonance saturation mechanism. Different sets of…

We compute corrections of order $\alpha_s^3$ to the decay $b \to c \ell \bar\nu$ taking into account massive charm quarks. In the on-shell scheme large three-loop corrections are found. However, in the kinetic scheme the three-loop…

Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.

Let $A$ be a subset of a finite field $F := \Z/q\Z$ for some prime $q$. If $|F|^\delta < |A| < |F|^{1-\delta}$ for some $\delta > 0$, then we prove the estimate $|A+A| + |A.A| \geq c(\delta) |A|^{1+\eps}$ for some $\eps = \eps(\delta) > 0$.…

We study online aggregation of the predictions of experts, and first show new second-order regret bounds in the standard setting, which are obtained via a version of the Prod algorithm (and also a version of the polynomially weighted…

We study a cut-off function lemma in projective spaces. We believe that this is well-known. We provide the details of the computation for later uses.

This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due…

We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing…