Related papers: A Sieve Method for Shifted Convolution Sums

In this paper, we propose a unified convergence analysis for a class of generic shuffling-type gradient methods for solving finite-sum optimization problems. Our analysis works with any sampling without replacement strategy and covers many…

We establish various upper bounds on Type-I and Type-II shifted bilinear sums with Sali\'e sums modulo a large prime $q$. We use these bounds to study, for fixed integers $a,b\not \equiv 0 \bmod q$, the distribution ofsolutions to the…

In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient…

Studying Birkhoff sums of non-integrable functions involves the challenge of large observations depending on the sampled orbit, which prevents pointwise limit theorems. To address this issue, the largest observations are removed, this…

Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…

We study the average shifted convolution sum $$ B(H,N):= \frac{1}{H} \sum_{h \sim H} \sum_{n \sim N} A_{\pi_1}(n)\, A_{\pi_2}(n+h), $$ where $A_{\pi_i}(n)$ denotes the Fourier coefficients of a Hecke--Maass cusp form $\pi_i$ for…

For the shifted convolution sum $$ D_h(X)=\sum_{m=1}^\infty\lambda_1(1,m)\lambda_2(m+h)V(\frac{m}{X}) $$ where $\lambda_1(1,m)$ are the Fourier coefficients of a $SL(3,\mathbb Z)$ Maass form $\pi_1$, and $\lambda_2(m)$ are those of a…

We give asymptotics for shifted convolutions of the form $$\sum_{n < X} \frac{\sigma_{2u}(n,\chi)\sigma_{2v}(n+k,\psi)}{n^{u+v}}$$ for nonzero complex numbers $u,v$ and nontrivial Dirichlet characters $\chi,\psi$. We use the technique of…

This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance…

The concept of QCD sum rules is extended to bound states composed of particles with finite mass such as scalar quarks or strange quarks. It turns out that mass corrections become important in this context. The number of relevant corrections…

We show that if k-SUM is hard, in the sense that the standard algorithm is essentially optimal, then a variant of the SETH called the Primal Treewidth SETH is true. Formally: if there is an $\varepsilon>0$ and an algorithm which solves SAT…

We propose the stochastic average gradient (SAG) method for optimizing the sum of a finite number of smooth convex functions. Like stochastic gradient (SG) methods, the SAG method's iteration cost is independent of the number of terms in…

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

Let $\lambda_i (n)$ $i= 1, 2, 3$ denote the normalised Fourier coefficients of holomorphic eigenform or Maass cusp form. In this paper we shall consider the sum: \[ S:= \frac{1}{H}\sum_{h\leq H} V\left( \frac{h}{H}\right)\sum_{n\leq N}…

We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations…

We investigate the numerical performance of the regularized deconvolution closure introduced recently by the authors. The purpose of the closure is to furnish constitutive equations for Irwing-Kirkwood-Noll procedure, a well known method…

We give a parameterized generalization of the sum formula for quadruple zeta values. The generalization has four parameters, and is invariant under a cyclic group of order four. By substituting special values for the parameters, we also…

We introduce the concept of compressed convolution, a technique to convolve a given data set with a large number of non-orthogonal kernels. In typical applications our technique drastically reduces the effective number of computations. The…

We describe a new method to bound certain higher-dimensional exponential sums which are associated with tori in symplectic groups over finite fields. Our method is based on the self-reducibility property of the Weil representation. As a…

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented for the Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function classes $B_{\pi,d}^q,\, q>1,\, d\in \mathbb N$, when…