相关论文: Elementary Evaluation of Convolution Sums involvin…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

The non-elementary integrals $\mbox{Si}_{\beta,\alpha}=\int [\sin{(\lambda x^\beta)}/(\lambda x^\alpha)] dx,\beta\ge1,\alpha>\beta+1$ and $\mbox{Ci}_{\beta,\alpha}=\int [\cos{(\lambda x^\beta)}/(\lambda x^\alpha)] dx, \beta\ge1,…

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates…

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…

In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

In the context of the Frobenius coin problem, given two relatively prime positive integers $a$ and $b$, the set of nonrepresentable numbers consists of positive integers that cannot be expressed as nonnegative integer combination of $a$ and…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary decompositions has even number of 1. We estimate of the sum $\sum\limits_{n\in \mathbf{N}_0,n\le X}\exp(2\pi i \alpha n^2)$.

We establish asymptotic estimates for exact upper bounds of uniform approximations by Fourier sums on the classes of $2\pi$-periodic functions, which are represented by convolutions of functions $\varphi (\varphi\bot 1)$ from unit ball of…

We consider several families of binomial sum identities whose definition involves the absolute value function. In particular, we consider centered double sums of the form \[S_{\alpha,\beta}(n) :=…

Let $f(z) = \sum A(n) n^{(k-1)/2} e(nz)$ be a cusp form of weight $k \geq 3$ on $\Gamma_0(N)$ with character $\chi$. By studying a certain shifted convolution sum, we prove that $\sum_{n \leq X} A(n^2+h) = c_{f,h} X +…

We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite…

We study the average size of shifted convolution summation terms related to the problem of Quantum Unique Ergodicity on ${\rm SL}_2 (\mathbbm{Z})\backslash \mathbbm{H}$. Establishing an upper-bound sieve method for handling such sums, we…

We prove new variants of the Lambert series factorization theorems studied by Merca and Schmidt (2017) which correspond to a more general class of Lambert series expansions of the form $L_a(\alpha, \beta, q) := \sum_{n \geq 1} a_n q^{\alpha…

Using modular forms we determine formulas for the number of representations of a positive integer by diagonal octonary quadratic forms with coefficients $1$, $2$, $3$ or $6$.

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

In \cite{ono}, K. Ono, S. Robins and P.T. Wahl considered the problem of determining formulas for the number of representations of a natural number $n$ by a sum of $k$ triangular numbers and derived many applications, including the one…

We propose an accurate algorithm for a novel sum-of-exponentials (SOE) approximation of kernel functions, and develop a fast algorithm for convolution quadrature based on the SOE, which allows an order $N$ calculation for $N$ time steps of…

We consider the problem of computing the Boolean convolution (with wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq \mathbb{Z}_m$. Boolean…