Related papers: Better than square-root cancellation for random mu…

In recent years, Sun has proposed numerous conjectures regarding the log-concavity of root sequences $\{\sqrt[n]{a_n}}_{n\geqslant 1}$. We establish criteria for the asymptotic log-concavity of $\{\sqrt[n]{a_n}}_{n\geqslant 1}$ and the…

We establish the limiting distribution of $\frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{n\le x}\alpha(n)$ where $\alpha$ is a Steinhaus random multiplicative function, answering a question of Harper. The distributional convergence is proved…

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

In this note, we develop a bounded-error quantum algorithm that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varepsilon$-far from being…

The Barnum-Knill theorem states that the optimal success probability in the multiple state discrimination task is not more than the square root of the success probability when the pretty good or square-root measurement is used for this…

We prove the Adler-Bardeen theorem in a large class of general gauge theories, including nonrenormalizable ones. We assume that the gauge symmetries are general covariance, local Lorentz symmetry and Abelian and non-Abelian Yang-Mills…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Stochastic optimization algorithms have become indispensable in modern machine learning. An unresolved foundational question in this area is the difference between with-replacement sampling and without-replacement sampling -- does the…

Stochastic variance reduction has proven effective at accelerating first-order algorithms for solving convex finite-sum optimization tasks such as empirical risk minimization. Incorporating second-order information has proven helpful in…

We improve the lower bound on worst case trace reconstruction from $\Omega\left(\frac{n^{5/4}}{\sqrt{\log n}}\right)$ to $\Omega\left(\frac{n^{3/2}}{\log^{7} n}\right)$. As a consequence, we improve the lower bound on average case trace…

Let $(M,g)$ be a $n-$dimensional, compact Riemannian manifold. We define the frequency scale $\lambda$ of a function $f \in C^{0}(M)$ as the largest number such that $\left\langle f, \phi_k \right\rangle =0$ for all Laplacian eigenfunctions…

We consider the random functions $S_N(z):=\sum_{n=1}^N z(n) $, where $z(n)$ is the completely multiplicative random function generated by independent Steinhaus variables $z(p)$. It is shown that ${\Bbb E} |S_N|\gg \sqrt{N}(\log…

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

Let $P_{n}(x)= \sum_{i=0}^n \xi_i x^i$ be a Kac random polynomial where the coefficients $\xi_i$ are iid copies of a given random variable $\xi$. Our main result is an optimal quantitative bound concerning real roots repulsion. This leads…

In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let $f$ be a nonnegative multiplicative function. We prove that if there exists a $\beta<1$ such that…

In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

We present theoretical and numerical evidence for a random matrix theoretic approach to a conjecture about vanishings of quadratic twists of certain L-functions