Related papers: GCD sums from Poisson integrals and systems of dil…

We prove that \[ \sum_{k,{\ell}=1}^N\frac{(n_k,n_{\ell})^{2\alpha}}{(n_k n_{\ell})^{\alpha}} \ll N^{2-2\alpha} (\log N)^{b(\alpha)} \] holds for arbitrary integers $1\le n_1<\cdots < n_N$ and $0<\alpha<1/2$ and show by an example that this…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

In [Yan22a], we defined so-called ``log-type" GCD sums and proved the lower bounds $\Gamma^{(\ell)}_1(N) \gg_{\ell} \left(\log\log N\right)^{2+2\ell}$. We will establish the upper bounds $\Gamma^{(\ell)}_1(N)\ll_{\ell} \left(\log \log…

In this note we prove a new estimate on so-called GCD sums (also called G\'{a}l sums), which, for certain coefficients, improves significantly over the general bound due to de la Bret\`{e}che and Tenenbaum. We use our estimate to prove new…

It is proved that \[ \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N\exp\left(C\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right) \] holds for arbitrary integers $1\le n_1<\cdots < n_N$. This bound is essentially…

Given a periodic function $f$, we study the almost everywhere and norm convergence of series $\sum_{k=1}^\infty c_k f(kx)$. As the classical theory shows, the behavior of such series is determined by a combination of analytic and number…

It is shown that the maximum of $|\zeta(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain…

We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-\alpha})$ for some $\alpha \in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD)…

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

We present a general framework to compute upper and lower bounds for linear-functional outputs of the exact solutions of the Poisson equation based on reconstructions of the field variable and flux for both the primal and adjoint problems.…

We study extremal problems for tuples of integers chosen from sets $A_i \subset [X_i,2X_i]$ for $1\le i\le k$, under large GCD and small LCM conditions. For the GCD problem, we extend the work of Green and Walker to higher dimensions.…

The newy developed approach to model nucleon generalized parton distributions (GPDs) H and E$ is based on two types of their representation in terms of double distributions. Within this approach, we re-consider the derivation of GPD sum…

We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain…

Let $\gcd(j,k)$ be the greatest common divisor of the integers $j$ and $k$. In this paper, we give several interesting asymptotic formulas for weighted averages of the $\gcd$-sum function $f(\gcd(j,k)) $ and the function $\sum_{d|k,…

We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of…

I use QCD sum rule ideas to construct models for generalized parton distributions. To this end, the perturbative parts of QCD sum rules for the pion and nucleon electromagnetic form factors are interpreted in terms of GPDs and two models…

Contents: 1. The sum rules or $\Gamma_{p,n}$.Theoretical status. 2. Calculations of matrix elements over the polarized nucleon by the QCD sum rule approach. 3. Twist-4 corrections to $\Gamma_{p,n}$ from QCD sum rules. 4. Gerasimov,…