Related papers: Sums over Vanishing Determinants
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
We determine explicitly the Gauss sums on the general linear group $GL_2(\mathbb{Z}/p^l\mathbb{Z})$ for all irreducible characters, where $p$ is an odd prime and $l$ is an integer > 1. While there are several studies of the Gauss sums on…
This is a survey of old and new problems and results in additive number theory.
We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.
Gaussian Quadrature is a well known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums have found some new interest. In this paper we apply these ideas to…
In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…
Gaussian blur is a commonly-used method to filter image data. This paper introduces the collapsing sum, a new operator on matrices that provides a combinatorial interpretation of Gaussian blur. We study the combinatorial properties of this…
We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.
In this paper, we will explicitly calculate Gauss sums for the general linear groups and the special linear groups over $\Bbb Z_n$, where $\Bbb Z_n=\Bbb Z/n \Bbb Z$ and $n>0$ is an integer. For $r$ being a positive integer, the formulae of…
Gauss quadrature integral approximation is extended to include integrals with a measure consisting of continuous as well as discrete components. That is, we give an approximation for the integral of a function plus its sum over a discrete…
Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…
We evaluate the sum of Gauss hypergeometric functions \[S(\mu,c;x)=\sum_{k\geq 0} \bl(\frac{1-x}{1+\mu}\br)^k\,{}_2F_1(\fs k+\fs, \fs k+1;c;x)\] for $x\in [-1,1]$ and positive parameters $\mu$ and $c$. The domain of absolute convergence of…
Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…
We connect a primitive operation from arithmetic -- summing the digits of a base-$B$ integer -- to $q$-series and product generating functions analogous to those in partition theory. We find digit sum generating functions to be intertwined…
We derive some new finite sums involving the sequence $s_{2}\left(n\right),$ the sum of digits of the expansion of $n$ in base $2.$ These functions allow us to generalize some classical results obtained by Allouche, Shallit and others.
We prove generalized ABC theorems for vanishing sums of non-Archimedean entire functions of several variables in arbitrary characteristic.
In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
This paper provides a technique for evaluating some nonlinear Gaussian sums in closed forms. The evaluation is obtained from the known values of simpler exponential sums.
We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…