Related papers: Beurling integers with RH and large oscillation

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

The Euler product formula relates Dirichlet $L(s,\chi)$ functions to an infinite product over primes, and is known to be valid for $\Re (s) >1$, where it converges absolutely. We provide arguments that the formula is actually valid for $\Re…

First idea is to compute a quantity like the angular momentum with respect to (0, 0), of an unitary mass of coordinates (<[Xi(s)], =[Xi(s)]) while =[s] is the time, and, <[s] = constant. If we impose that the derivative along <[s], at…

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

We shed new light on Heisenberg's uncertainty principle in the sense of Beurling, by offering an essentially different proof which permits us to weaken the assumptions substantially, and examples show that the result is sharp. The proof…

Count data with zero inflation and large outliers are ubiquitous in many scientific applications. However, posterior analysis under a standard statistical model, such as Poisson or negative binomial distribution, is sensitive to such…

We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated with primitive characters of modulus…

We show that the frame measure function of a frame in certain reproducing kernel Hilbert spaces on metric measure spaces is given by the reciprocal of the Beurling density of its index set. In addition, we show that each such frame with…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

Sparse estimation methods capable of tolerating outliers have been broadly investigated in the last decade. We contribute to this research considering high-dimensional regression problems contaminated by multiple mean-shift outliers which…

This paper studies the control-oriented identification problem of set-valued moving average systems with uniform persistent excitations and observation noises. A stochastic approximation-based (SA-based) algorithm without projections or…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

Assume the Riemann hypothesis throughout. We obtain some new estimates for the size of the set of large values of the error term in the prime number theorem. Our argument is based on an analysis of the behavior of zeros of the Riemann zeta…

We consider the Dirichlet series associated to the number of representations of an integer as the sum of primes. Assuming the Riemann hypothesis on the distribution of the zeros of the Riemann zeta function we obtain the domain of…

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

The incorporation of priors in the Optimal Uncertainty Quantification (OUQ) framework \cite{OSSMO:2011} reveals brittleness in Bayesian inference; a model may share an arbitrarily large number of finite-dimensional marginals with, or be…

Denote by $\Omega(n)$ the number of prime divisors of $n \in \mathbb{N}$ (counted with multiplicities). For $x\in \mathbb{N}$ define the Dirichlet-Bohr radius $L(x)$ to be the best $r>0$ such that for every finite Dirichlet polynomial…

Integer counting processes increment of an integer value at transitions between states of an underlying Markov process. The generator of a counting process, which depends on a parameter conjugate to the increments, defines a complex…

It is well known that the Euler method for a random ordinary differential equation $\mathrm{d}X_t/\mathrm{d}t = f(t, X_t, Y_t)$ driven by a stochastic process $\{Y_t\}_t$ with $\theta$-H\"older sample paths is estimated to be of strong…