Autocorrelation



I was looking at the sum

sum(sum(1/k^s*1/(m+k)^s,k=1..oo),m=1..oo)

and noticed it looks a lot like the total of the autocorrelation of 1/k^s

i.e.

if we take the autocorrelation of 1/k^s we get

c(m) = sum(1/k^s/(k+m)^s,k=1..oo)

and hence the sum above is the "total correlation"

but we know that there is a relation between the fourier series and the
autocorrelation given at
http://mathworld.wolfram.com/Wiener-KhinchinTheorem.html

hence

c*(m) = F_m[1/k^(2s)]

and we "should" be able to compute the original sum by summing over c* from
1 to oo.

I didn't get anywhere but seems like the idea should be correct(asside from
the technicalities that I didn't really get into...)?

Jon


.



Relevant Pages

  • Re: sum
    ... > Jon Slaughter wrote: ... >> sum I need... ... the general coefficient could be: ...
    (sci.math)
  • Re: sum of zetas
    ... > Am 07.09.05 17:10 schrieb Jon Slaughter: ... the sum above is the same as summing over the upper part of the matrix. ...
    (sci.math)
  • Re: what makes it true?
    ... mathematical theorem: if Goldbach's conjecture ... greater than 2 is the sum of two primes. ... Prev by Date: ...
    (sci.math)
  • Re: VLookup returns #VALUE!
    ... which interferes with =SUM ... > I'm stuck. ... Prev by Date: ...
    (microsoft.public.excel.worksheet.functions)
  • Eliminate unused columns
    ... is there a smarter way to do the conversion than sum across an fill ... Prev by Date: ...
    (microsoft.public.excel.misc)