相关论文: Approximating the main conjecture in Vinogradov's …

We use decoupling theory to prove a sharp (up to $N^\epsilon$ losses) estimate for Vinogradov's mean value theorem in two dimensions

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

Let $U$ be a unitary operator acting on the Hilbert space $\ch$, and $\a:\{1,..., 2k\}\mapsto\{1,..., k\}$ a pair partition. Then the ergodic average $$ \frac{1}{N^{k}}\sum_{n_{1},...,n_{k}=0}^{N-1} U^{n_{\a(1)}}A_{1}U^{n_{\a(2)}}...…

A discussion of recent work of C.Demeter, L.Guth and the author of the proof of the Vinogradov Main Conjecture using the decoupling theory for curves

We prove Sarnak's spherical density conjecture for the principal congruence subgroup of SL(n, Z) of arbitrary level. Applications include a complete version of Sarnak's optimal lifting conjecture for principal congruence subgroups of SL(n,…

We interpret into decoupling language a refinement of a 1973 argument due to Karatsuba on Vinogradov's mean value theorem. The main goal of our argument is to answer what precisely does solution counting in older partial progress on…

A functional analog of the Klain-Schneider theorem for vector-valued valuations on convex functions is established, providing a classification of continuous, translation covariant, simple valuations. Under additional rotation equivariance…

For an ergodic action of the group $Z^n$ on a probability space and a given arbitrarily slowly decreasing to zero sequence, there exists an integrable function such that the standard ergodic time averages for it converge almost everywhere…

Temporal difference learning with linear function approximation is a popular method to obtain a low-dimensional approximation of the value function of a policy in a Markov Decision Process. We give a new interpretation of this method in…

The article is devoted to the estimation of the rate of convergence of integral functionals of a Markov process. Under the assumption that the given Markov process admits a transition probability density which is differentiable in $t$ and…

In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…

This is the expository essay that accompanies my Bourbaki Seminar on 17 June 2017 on the landmark proof of the Vinogradov Mean Value Theorem, and the two approaches developed in the work of Wooley and of Bourgain, Demeter and Guth.

This paper gives a unified and succinct approach to the $O(1/\sqrt{k}), O(1/k),$ and $O(1/k^2)$ convergence rates of the subgradient, gradient, and accelerated gradient methods for unconstrained convex minimization. In the three cases the…

It is well known that both gradient descent and stochastic coordinate descent achieve a global convergence rate of $O(1/k)$ in the objective value, when applied to a scheme for minimizing a Lipschitz-continuously differentiable,…

We study discrete versions of fractional integral operators along curves and surfaces. $l^p \to l^q$ estimates are obtained from upper bounds of the number of solutions of associated Diophantine systems. In particular, this relates the…

We show for all $1/2 \le \sigma \le 1$ and $t\ge 3$ that $\zeta(\sigma+it)| \le 76.2 t^{4.45 (1-\sigma)^{3/2}}$, where $\zeta$ is the Riemann zeta function. This significantly improves the previous bounds, where $4.45$ is replaced by…

We give an effective version with explicit constants of a mean value theorem of Vaughan related to the values of \psi(y, \chi), the twisted summatory function associated to the von Mangoldt function \Lambda and a Dirichlet character \chi.…

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

When the target parameter for inference is a real-valued, continuous function of probabilities in the $k$-sample multinomial problem, variance estimation may be challenging. In small samples or when the function is nondifferentiable at the…