Talk:Hurwitz zeta function

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated Start-class, Mid-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Mid Importance
 Field:  Number theory

Multiplication theorem[edit]

There is a useful generalization of the multiplication theorem for the Hurwitz zeta function. In Maple notation:

   sum(Zeta(s,a+p/q),p=1..q-1) = q^s*Zeta(s,q*a)

where (q-1) is a natural number. It reduces to the simpler form on writing a=1/q (and recalling that Zeta(s,1) is the Riemann zeta function). [The proof is trivial ...]

So put it into the article. The above equation in LaTeX is

PAR 20:21, 3 August 2006 (UTC)

Sorry - I made an error. The lower bound of the sum (over p) should be zero, not unity! So -

Hair Commodore 22:00, 30 October 2006 (UTC)

region of convergence[edit]

The series, and other formulas, should include a discussion of the regions of absolute and conditional convergence. I slapped an expert tag on the section introducing this idea. linas (talk) 20:36, 18 November 2007 (UTC)

Well my markup foo is lacking, but ..... The series always locally converges. At a series of small points arranged around a singularity pole, the radius converges upto the singularity, so the singularities are surrounded by convergence from all sides. Thye singular points of divergence are then not divergent ranges, but singular points which are singular, and so the function converges to the true value of the function in an infinite radius of convergence. The function is thus fully described in it's entirety, it is an or has an entire description.

How do? Same man who added entire gamma formula to bottom of this page. (talk) 12:24, 27 January 2015 (UTC)

The Hurwitz zeta function generalizes the polygamma function:[edit]

How does it generalize PolyGamma if the identity in fact holds only for integers? Usually PolyGamma is generalized in a different way.--MathFacts (talk) 13:04, 14 November 2009 (UTC)

A representation of Gamma[edit]

Gamma[z] = constant Exp[D[(s-1) HurwitzZeta[s,p],s]] /. p -> z /. s-> 1

I think this proves Gamma is entire. It requires the use of L'Hopitals rule when in the limit, and using the differential in the second argument need integrating. And stuff the whole lot into the 0th polygamma definition. (talk) 15:36, 26 January 2015 (UTC) pdf bottom of page, final page has formula. just need the constant calculating to fit positives.

Gamma[z] = Const Exp[Sum[1/(n+1) Sum[(-1)^(k+1) Binomial[n, k] Log[k+z], {k, 0, n}], {n, 0, Infinity}]]

Assuming the binomial n!/((n-k)!k!) and z in Complex (talk) 12:14, 27 January 2015 (UTC)

The nature of the entire description means the negative axis is correct, and the Euler graph is wrong. This is to do with the termination of the Euler definition of factorial ending as a count down to 1, and not continuing to minus infinity. So this ENTIRE gamma is based on an infinite product of the value of this ENTIRE gamma down to minus infinity.

The Euler gamma makes a mistake of including an absolute magnitude operation in the algorithm by carrying out an inverse plus one iteration on negative parameter values. This prevents entirity, and also using the Risch algorithm on the Euler gamma.

Why do differential equations need like the Bessel, or Bessel-Clifford need alternate solution functions? The negative gamma values? Another note on the multiplicative inverse of entire functions. Think about it! — Preceding unsigned comment added by (talk) 12:38, 27 January 2015 (UTC)