scholarly journals Some Finite Analogues of the Poisson Summation Formula

1961 ◽  
Vol 12 (3) ◽  
pp. 133-138 ◽  
Author(s):  
L. Carlitz

1. Guinand (2) has obtained finite identities of the typewhere m, n, N are positive integers and eitherorwhere γ is Euler's constant and the notation ∑′ indicates that when x is integral the term r = x is multiplied by ½. Clearly there is no loss of generality in taking N = 1 in (1.1).

1963 ◽  
Vol 13 (4) ◽  
pp. 331-332 ◽  
Author(s):  
R. A. Rankin

Let pn denote the nth prime and let ε be any positive number. In 1938 (3) Ishowed that, for an infinity of values of n,where, for k≧1, logk+1x = log (logk x) and log1x = log x. In a recent paper (4) Schönhage has shown that the constant ⅓ may be replaced by the larger number ½eγ, where γ is Euler's constant; this is achieved by means of a more efficient selection of the prime moduli used. Schönhage uses an estimate of mine for the number B1 of positive integers n≦u that consist entirely of prime factors p≦y, whereHerer x is large and α and δ are positive constants to be chosen suitably.


Author(s):  
Nelson Petulante

We establish a generalized version of the classical Poisson summation formula. This formula incorporates a special feature called “compression”, whereby, at the same time that the formula equates a series to its Fourier dual, the compressive feature serves to enable both sides of the equation to converge.


Sign in / Sign up

Export Citation Format

Share Document