Related papers: On the exponential large sieve inequality for spar…
We study Frege proofs using depth-$d$ Boolean formulas for the Tseitin contradiction on $n \times n$ grids. We prove that if each line in the proof is of size $M$ then the number of lines is exponential in $n/(\log M)^{O(d)}$. This…
We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…
We show how to carry out a sieve of Eratosthenes up to N in space O(N^{1/3} (log N)^{2/3}) and time O(N log N). These bounds constitute an improvement over the usual versions of the sieve, which take space about O(sqrt{N}) and time at least…
Sparsity plays a central role in recent developments in signal processing, linear algebra, statistics, optimization, and other fields. In these developments, sparsity is promoted through the addition of an $L^1$ norm (or related quantity)…
For $\Gamma$ a Fuchsian Group of the first kind, we obtain large sieve inequalities with weights the hyperbolic periods of Maass forms of even weight. This is inspired by work of Chamizo, who proved a large sieve inequality with weights…
In 2016 Lemke Oliver and Soundararajan examined the gaps between the first hundred million primes and observed biases in their distributions modulo 10. Given our work on the evolution of the populations of various gaps across stages of…
We consider the stochastic optimization problem where a convex function is minimized observing recursively the gradients. We introduce SAEW, a new procedure that accelerates exponential weights procedures with the slow rate $1/\sqrt{T}$ to…
In this article, we derive better results concerning powered numbers in short intervals, both unconditionally and conditionally on the $abc$-conjecture. We make use of sieve method, a polynomial identity, and a recent breakthrough result on…
Can linear systems be solved faster than matrix multiplication? While there has been remarkable progress for the special cases of graph structured linear systems, in the general setting, the bit complexity of solving an $n \times n$ linear…
This work is a follow-up to our previous contribution ("Convergence of sparse collocation for functions of countably many Gaussian random variables (with application to elliptic PDEs)", SIAM J. Numer. Anal., 2018), and contains further…
The tuning of stochastic gradient algorithms (SGAs) for optimization and sampling is often based on heuristics and trial-and-error rather than generalizable theory. We address this theory--practice gap by characterizing the large-sample…
We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…
We study the design and implementation of numerical methods to solve the generalized Langevin equation (GLE) focusing on canonical sampling properties of numerical integrators. For this purpose, we cast the GLE in an extended phase space…
We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…
We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…
Let $(M_n)_{n\geq0}$ be the Mersenne sequence defined by $M_n=2^n-1$. Let $\omega(n)$ be the number of distinct prime divisors of $n.$ In this short note, we present a description of the Mersenne numbers satisfying $\omega(M_n)\leq3$.…
This thesis studies high-dimensional, continuous-valued pairwise Markov Random Fields. We are particularly interested in approximating pairwise densities whose logarithm belongs to a Sobolev space. For this problem we propose the method of…
We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…
We mainly investigate the log-Harnack inequality for the reflected stochastic partial differential equation driven by multiplicative noises based on the gradient estimate of the associated Markov semigroup. To do it, the penalization method…
Some extensions of an inequality from IMO'2001 are proven by means of the Lagrange multiplier criterion.