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

We study the shifted convolution sum of the divisor function and some other arithmetic functions.

In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m^2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we…

We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…

Let $p$ be an odd prime and let $f(x)=\sum_{i=1}^ka_ix^{p^{\alpha_i}+1}\in\Bbb F_{p^n}[x]$, where $0\le \alpha_1<...<\alpha_k$. We consider the exponential sum $S(f,n)=\sum_{x\in\Bbb F_{p^n}}e_n(f(x))$, where $e_n(y)=e^{2\pi…

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

In this paper, by using the method of Contour Integral Representations and the Theorem of Residues and integral representations of series, we discuss the analytic representa- tions of parametric Euler sums that involve harmonic numbers…

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

A first characterization of the isomorphism classes of $k$-involutions for any reductive algebraic group defined over a perfect field was given in \cite{Helm2000} using $3$ invariants. In \cite{HWD04,Helm-Wu2002} a full classification of…

This paper studies a family of convolution quadratures, a numerical technique for efficient evaluation of convolution integrals. We employ the block generalized Adams method to discretize the underlying initial value problem, departing from…

Let $$\sum_{\substack{d|n\\ d\equiv 1 (2)}}\frac{1}{d}$$ denote the sum of inverses of odd divisors of a positive integer $n$, and let $c_{r}(n)$ be the number of representations of $n$ as a sum of $r$ squares where representations with…

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

We survey arithmetic and asymptotic properties of the alternating sum-of-divisors function $\beta$ defined by $\beta(p^a)=p^a-p^{a-1}+p^{a-2}-...+(-1)^a$ for every prime power $p^a$ ($a\ge 1$), and extended by multiplicativity. Certain open…

A rational Ansatz is proposed for the generating function $\sum_{j,k} \beta_{2j+k,2j}x^j y^k$, where $\beta_{m,u}$ is the number of primitive chinese character diagrams with $u$ univalent and $2m-u$ trivalent vertices. For…

Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…

Additive divisor sums play a prominent role in the theory of the moments of the Riemann zeta function. There is a long history of determining sharp asymptotic formula for the shifted convolution sum of the ordinary divisor function. In…

We study the sum $\sum_{abc \leq x} \Omega([a,b,c])$, where $\Omega(n)$ denotes the number of distinct prime divisors of $n \in \mathbb{Z}_{\geq 1}$, counted with multiplicity, and where $(a,b,c) = \gcd(a,b,c)$ and $[a,b,c] =…

The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…