Related papers: Primes in arithmetic progressions on average I

In this article we study, via analytical methods, $1/Q$ non-perturbative power corrections to event shape mean values, addressing in particular the question of their interplay with soft perturbative emissions. Specifically we point out that…

We report on the computation of the $B_s$ meson decay constant in Heavy Quark Effective Theory on the lattice. The next to leading order corrections in the HQET expansion are included non-perturbatively. We estimate higher order…

If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications…

The procedure of the estimates of the higher-order perturbative QCD corrections to the physical quantities is generalized to the case when the quantities under consideration obey the renormalization group equationts with the corresponding…

We prove $q$-variation estimates, $q>2$, on $\ell^{p}$ spaces for averages along primes (with $1<p<\infty$) and polynomials (with $\big| \frac1p - \frac12 \big| < \frac{1}{2(d+1)}$, where $d$ is the degree of the polynomial). This improves…

This paper investigates the potential of quantum acceleration in addressing infinite horizon Markov Decision Processes (MDPs) to enhance average reward outcomes. We introduce an innovative quantum framework for the agent's engagement with…

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

We prove performance guarantees of two algorithms for approximating $Q^\star$ in batch reinforcement learning. Compared to classical iterative methods such as Fitted Q-Iteration---whose performance loss incurs quadratic dependence on…

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…

Quantum computers have shown promise in improving algorithms in a variety of fields. The realization of these advancements is limited by the presence of noise and high error rates, which become prominent especially with increasing system…

Andrade and Keating computed the mean value of quadratic Dirichlet $L$--functions at the critical point, in the hyperelliptic ensemble over a fixed finite field $\mathbb{F}_q$. Summing $L(1/2,\chi_D)$ over monic, square-free polynomials $D$…

Let $\{q_n\}_{n=0}^\infty\subset [0,1]$ satisfy $q_0=0$, $\sum_{n=0}^\infty q_n=1$, and $\gcd\{n\geq 1\mid q_n\neq 0\}=1$. We consider the following process: Let $x$ be a real number. We first set $x=0$. Then $x$ is increased by $i$ with…

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

We establish that an optimistic variant of Q-learning applied to a fixed-horizon episodic Markov decision process with an aggregated state representation incurs regret $\tilde{\mathcal{O}}(\sqrt{H^5 M K} + \epsilon HK)$, where $H$ is the…

We say that $d_3(n)$ has exponent of distribution $\theta$ if, for every $\varepsilon>0$, the expected asymptotic holds uniformly for all moduli $q \le x^{\theta-\varepsilon}$. Nguyen proved, following earlier work of Banks, Heath-Brown,…

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

We investigate the performance of a quantum error-correcting code when pushed beyond its intended capacity to protect information against errors, presenting formulae for the probability of failure when the errors affect more qudits than…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We investigate the existence of well-behaved Beurling number systems, which are systems of Beurling generalized primes and integers which admit a power saving in the error term of both their prime and integer-counting function. Concretely,…

We give a summary about the various contributions which have to be calculated in order to obtain the next-to-leading logarithmic result for the branching ratio $BR(B \to X_s \gamma)$. Combining all these ingredients, which were obtained by…