Related papers: Almost sure upper bound for random multiplicative …

For various compactly supported perturbations of the Laplacian in odd dimensions $n$, we prove a sharp upper bound of the resonance counting function $N(r)$ of the type $N(r) \le A_n r^n(1+o(1))$ with an explicit constant $A_n$. In a few…

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…

We prove that the maximum of two smooth strictly plurisubharmonic functions on an almost complex manifold can be uniformly approximated by smooth strictly plurisubharmonic functions.

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Let $a_1, \dots, a_n \in \mathbb{R}$ satisfy $\sum_i a_i^2 = 1$, and let $\varepsilon_1, \ldots, \varepsilon_n$ be uniformly random $\pm 1$ signs and $X = \sum_{i=1}^{n} a_i \varepsilon_i$. It is conjectured that $X = \sum_{i=1}^{n} a_i…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove…

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Let $\xi_0,\xi_1,\ldots$ be independent identically distributed complex- valued random variables such that $\mathbb{E}\log(1+|\xi _0|)<\infty$. We consider random analytic functions of the form…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

In this paper we investigate problems on almost everywhere convergence of subsequences of Riemann sums \md0 R_nf(x)=\frac{1}{n}\sum_{k=0}^{n-1}f\bigg(x+\frac{k}{n}\bigg),\quad x\in \ZT. \emd We establish a relevant connection between…

In this paper, we derive the following asymptotic formula $$ \mathop{{\sum}'}_{n\leqslant x}\dfrac{r(n)}{r(n+1)} = {x}{(\ln x)^{-3/4}}(c+o(1)),\ \ x \to +\infty,$$ where $r(n)$ is the number of representations of $n$ as a sum of two…

The goal of this work is to prove an analogue of a recent result of Harper on almost sure lower bounds of random multiplicative functions, in a setting that can be thought of as a simplified function field analogue. It answers a question…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data…

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…