The Riemann zeta function and tuning: Difference between revisions
m →k-ary peak edos: standardize hyphenation (there is indeed a hyphen) |
ArrowHead294 (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
The Riemann zeta function is a famous mathematical function, best known for its relationship with the Riemann hypothesis, a 200-year old unsolved problem involving the distribution of the prime numbers. However, it also has an incredible musical interpretation as measuring the "harmonicity" of an equal temperament. Put simply, the zeta function shows, in a certain sense, how well a given equal temperament approximates the harmonic series, and indeed ''all'' rational numbers, even up to "infinite-limit JI." | The Riemann zeta function is a famous mathematical function, best known for its relationship with the Riemann hypothesis, a 200-year old unsolved problem involving the distribution of the prime numbers. However, it also has an incredible musical interpretation as measuring the "harmonicity" of an equal temperament. Put simply, the zeta function shows, in a certain sense, how well a given equal temperament approximates the harmonic series, and indeed ''all'' rational numbers, even up to "infinite-limit JI." | ||
As a result, although the zeta function is best known for its use in analytic number theory, the zeta function is ever-present in the background of tuning theory — the [[harmonic entropy]] model of [[concordance]] can be shown to be related to the Fourier transform of the zeta function, and several tuning-theoretic metrics, if extended to the infinite-limit, yield expressions that are related to the zeta function. Sometimes these are in terms of the "prime zeta function," which is closely related and can also be derived as an simple expression of the zeta function. | As a result, although the zeta function is best known for its use in analytic number theory, the zeta function is ever-present in the background of tuning theory—the [[harmonic entropy]] model of [[concordance]] can be shown to be related to the Fourier transform of the zeta function, and several tuning-theoretic metrics, if extended to the infinite-limit, yield expressions that are related to the zeta function. Sometimes these are in terms of the "prime zeta function," which is closely related and can also be derived as an simple expression of the zeta function. | ||
Much of the below is thanks to the insights of [[Gene Ward Smith]]. Below is the original derivation as he presented it, followed by a different derivation from [[Mike Battaglia]] below which extends some of the results. | Much of the below is thanks to the insights of [[Gene Ward Smith]]. Below is the original derivation as he presented it, followed by a different derivation from [[Mike Battaglia]] below which extends some of the results. | ||
<math> | |||
\def\abs#1{\left|{#1}\right|} | |||
\def\floor#1{\left\lfloor{#1}\right\rfloor} | |||
\def\ceil#1{\left\lceil{#1}\right\rceil} | |||
\def\round#1{\left\lceil{#1}\right\rfloor} | |||
\def\rfrac#1{\left\lfloor{#1}\right\rceil} | |||
</math> | |||
== Gene Smith's original derivation == | == Gene Smith's original derivation == | ||
=== Preliminaries === | === Preliminaries === | ||
Suppose ''x'' is a variable representing some equal division of the octave. For example, if ''x'' = 80, ''x'' reflects 80edo with a step size of 15 cents and with pure octaves. Suppose that ''x'' can also be continuous, so that it can also represent fractional or "nonoctave" divisions as well. The [[Bohlen-Pierce|Bohlen-Pierce scale]], 13 equal divisions of 3/1, is approximately 8.202 equal divisions of the "octave" (although the octave itself does not appear in this tuning), and would hence be represented by a value of ''x'' = 8.202. | Suppose ''x'' is a variable representing some equal division of the octave. For example, if ''x'' = 80, ''x'' reflects 80edo with a step size of 15 cents and with pure octaves. Suppose that ''x'' can also be continuous, so that it can also represent fractional or "nonoctave" divisions as well. The [[Bohlen-Pierce|Bohlen-Pierce scale]], 13 equal divisions of 3/1, is approximately 8.202 equal divisions of the "octave" (although the octave itself does not appear in this tuning), and would hence be represented by a value of ''x'' = 8.202. | ||
Now suppose that | Now suppose that ⌊x⌉ denotes the difference between ''x'' and the integer nearest to ''x''. For example, ⌊8.202⌉ would be 0.202, since it's the difference between 8.202 and the nearest integer, which is 8. ⌊7.95⌉ would be 0.05, which is the difference between 7.95 and the nearest integer, which is 8. Mathematically speaking, <math>\rfrac{x} = \abs{x - \floor{x + \frac{1}{2}}}</math>. | ||
For any value of ''x'', we can construct a ''p''-limit [[Patent_val|generalized patent val]]. We do so by rounding ''x'' log<sub>2</sub>(''q'') to the nearest integer for each prime ''q'' up to ''p''. Now consider the function | For any value of ''x'', we can construct a ''p''-limit [[Patent_val|generalized patent val]]. We do so by rounding ''x'' log<sub>2</sub>(''q'') to the nearest integer for each prime ''q'' up to ''p''. Now consider the function | ||
<math>\displaystyle \xi_p(x) = \sum_{\substack{2 \leq q \leq p \\ q \text{ prime}}} \left(\frac{ | <math>\displaystyle \xi_p(x) = \sum_{\substack{2 \leq q \leq p \\ q \text{ prime}}} \left(\frac{\rfrac{x \log_2 q}}{\log_2 q}\right)^2</math> | ||
This function has local minima, corresponding to associated generalized patent vals. The minima occur for values of x which are the [[Tenney-Euclidean_Tuning|Tenney-Euclidean tuning]]s of the octaves of the associated vals, while ξ<sub>''p''</sub> for these minima is the square of the [[Tenney-Euclidean_metrics|Tenney-Euclidean relative error]] of the val | This function has local minima, corresponding to associated generalized patent vals. The minima occur for values of x which are the [[Tenney-Euclidean_Tuning|Tenney-Euclidean tuning]]s of the octaves of the associated vals, while ξ<sub>''p''</sub> for these minima is the square of the [[Tenney-Euclidean_metrics|Tenney-Euclidean relative error]] of the val&mash;equal to the TE error times the TE complexity, and sometimes known as "TE simple badness." | ||
Now suppose we don't want a formula for any specific prime limit, but which applies to all primes. We can't take the above sum to infinity, since it doesn't converge. However, we could change the weighting factor to a power so that it does converge: | Now suppose we don't want a formula for any specific prime limit, but which applies to all primes. We can't take the above sum to infinity, since it doesn't converge. However, we could change the weighting factor to a power so that it does converge: | ||
<math>\displaystyle \xi_\infty(x) = \sum_{\substack{q \geq 2 \\ q \text{ prime}}} \frac{ | <math>\displaystyle \xi_\infty(x) = \sum_{\substack{q \geq 2 \\ q \text{ prime}}} \frac{\rfrac{x \log_2 q}^2}{q^s}</math> | ||
If ''s'' is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/''n'' for each prime power ''p''<sup>''n''</sup>. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[Wikipedia:Von Mangoldt function|Von Mangoldt function]], an [[Wikipedia:arithmetic function|arithmetic function]] on positive integers which is equal to ln ''p'' on prime powers ''p''<sup>''n''</sup>, and is zero elsewhere. This is written using a capital lambda, as Λ(''n''), and in terms of it we can include prime powers in our error function as | If ''s'' is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/''n'' for each prime power ''p''<sup>''n''</sup>. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[Wikipedia:Von Mangoldt function|Von Mangoldt function]], an [[Wikipedia:arithmetic function|arithmetic function]] on positive integers which is equal to ln ''p'' on prime powers ''p''<sup>''n''</sup>, and is zero elsewhere. This is written using a capital lambda, as Λ(''n''), and in terms of it we can include prime powers in our error function as | ||
<math>\displaystyle \xi_\infty(x) = \sum_{n \geq 1} \frac{\Lambda(n)}{\ln n} \frac{ | <math>\displaystyle \xi_\infty(x) = \sum_{n \geq 1} \frac{\Lambda(n)}{\ln n} \frac{\rfrac{x \log_2 n}^2}{n^s}</math> | ||
where the summation is taken formally over all positive integers, though only the primes and prime powers make a nonzero contribution. | where the summation is taken formally over all positive integers, though only the primes and prime powers make a nonzero contribution. | ||
Another consequence of the above definition which might be objected to is that it results in a function with a [[Wikipedia:Continuous_function#Relation_to_differentiability_and_integrability|discontinuous derivative]], whereas a smooth function be preferred. The function | Another consequence of the above definition which might be objected to is that it results in a function with a [[Wikipedia:Continuous_function#Relation_to_differentiability_and_integrability|discontinuous derivative]], whereas a smooth function be preferred. The function ⌊x⌉<sup>2</sup> is quadratically increasing near integer values of x, and is periodic with period 1. Another function with these same properties is 1 − cos(2π''x''), which is a smooth and in fact an [[Wikipedia:entire function|entire function]]. Let us therefore now define for any ''s'' > 1 | ||
<math>\displaystyle E_s(x) = \sum_{n \geq 1} \frac{\Lambda(n)}{\ln n} \frac{1 - \cos(2 \pi x \log_2 n)}{n^s}</math> | <math>\displaystyle E_s(x) = \sum_{n \geq 1} \frac{\Lambda(n)}{\ln n} \frac{1 - \cos(2 \pi x \log_2 n)}{n^s}</math> | ||
For any fixed ''s'' > 1 this gives a real [[Wikipedia:analytic function|analytic function]] defined for all ''x'', and hence with all the smoothness properties we could desire. | For any fixed ''s'' > 1 this gives a real [[Wikipedia:analytic function|analytic function]] defined for all ''x'', and hence with all the smoothness properties we could desire. | ||
We can clean up this definition to get essentially the same function: | We can clean up this definition to get essentially the same function: | ||
Line 48: | Line 55: | ||
=== Into the critical strip === | === Into the critical strip === | ||
So long as ''s'' | So long as ''s'' ≥ 1, the absolute value of the zeta function can be seen as a relative error measurement. However, the rationale for that view of things departs when ''s'' < 1, particularly in the [http://mathworld.wolfram.com/CriticalStrip.html critical strip], when 0 < ''s'' < 1. As s approaches the value ''s'' = {{frac|2}} of the [http://mathworld.wolfram.com/CriticalLine.html critical line], the information content, so to speak, of the zeta function concerning higher primes increases and it behaves increasingly like a badness measure (or more correctly, since we have inverted it, like a goodness measure.) The quasi-symmetric [https://planetmath.org/encyclopedia/FunctionalEquationOfTheRiemannZetaFunction.html functional equation] of the zeta function tells us that past the critical line the information content starts to decrease again, with 1 − ''s'' and ''s'' having the same information content. Hence it is the zeta function between ''s'' = {{frac|2}} and ''s'' = 1, and especially the zeta function along the critical line ''s'' = {{frac|2}}, which is of the most interest. | ||
As ''s'' > 1 gets larger, the Dirichlet series for the zeta function is increasingly dominated by the 2 term, getting ever closer to simply 1 + 2<sup> | As ''s'' > 1 gets larger, the Dirichlet series for the zeta function is increasingly dominated by the 2 term, getting ever closer to simply 1 + 2<sup>−''z''</sup>, which approaches 1 as ''s'' = Re(''z'') becomes larger. When ''s'' >> 1 and ''x'' is an integer, the real part of zeta is approximately 1 + 2<sup>−''s''</sup>, and the imaginary part is approximately zero; that is, zeta is approximately real. Starting from ''s'' = +∞ with ''x'' an integer, we can trace a line back towards the critical strip on which zeta is real. Since when ''s'' >> 1 the derivative is approximately -ln(2)/2<sup>''s''</sup>, it is negative on this line of real values for zeta, meaning that the real value for zeta increases as ''s'' decreases. The zeta function approaches 1 uniformly as ''s'' increases to infinity, so as ''s'' decreases, the real-valued zeta function along this line of real values continues to increase though all real values from 1 to infinity monotonically. When it crosses the critical line where ''s'' = {{frac|2}}, it produces a real value of zeta on the critical line. Points on the critical line where ζ({{frac|2}} + i''g'') are real are called "Gram points", after [[Wikipedia:Jørgen Pedersen Gram|Jørgen Pedersen Gram]]. We thus have associated pure-octave edos, where ''x'' is an integer, to a value near to the pure octave, at the special sorts of Gram points which corresponds to edos. | ||
Because the value of zeta increased continuously as it made its way from + | Because the value of zeta increased continuously as it made its way from +∞ to the critical line, we might expect the values of zeta at these special Gram points to be relatively large. This would be especially true if −ζ'(''z'') is getting a boost from other small primes as it travels toward the Gram point. A complex formula due to [[Wikipedia:Bernhard Riemann|Bernhard Riemann]] which he failed to publish because it was so nasty becomes a bit simpler when used at a Gram point. It is named the [[Wikipedia:Riemann-Siegel formula|Riemann-Siegel formula]] since [[Wikipedia:Carl Ludwig Siegel|Carl Ludwig Siegel]] went looking for it and was able to reconstruct it after rooting industriously around in Riemann's unpublished papers. From this formula, it is apparent that when x corresponds to a good edo, the value of ζ({{frac|2}} + i''g'') at the corresponding Gram point should be especially large. | ||
=== The Z function === | === The Z function === | ||
The absolute value | The absolute value ζ({{frac|2}} + i''g'') at a Gram point corresponding to an edo is near to a local maximum, but not actually at one. At the local maximum, of course, the partial derivative of ζ({{frac|2}} + i''t'') with respect to ''t'' will be zero; however this does not mean its derivative there will be zero. In fact, the [[Wikipedia:Riemann hypothesis|Riemann hypothesis]] is equivalent to the claim that all zeros of ζ'(''s'' + i''t'') occur when ''s'' > 1/2, which is where all known zeros lie. These do not have values of ''t'' corresponding to good edos. For this and other reasons, it is helpful to have a function which is real for values on the critical line but whose absolute value is the same as that of zeta. This is provided by the [[Wikipedia:Z function|Z function]]. | ||
In order to define the Z function, we need first to define the [[Wikipedia:Riemann-Siegel theta function|Riemann-Siegel theta function]], and in order to do that, we first need to define the [http://mathworld.wolfram.com/LogGammaFunction.html Log Gamma function]. This is not defined as the natural log of the Gamma function since that has a more complicated branch cut structure; instead, the principal branch of the Log Gamma function is defined as having a branch cut along the negative real axis, and is given by the series | In order to define the Z function, we need first to define the [[Wikipedia:Riemann-Siegel theta function|Riemann-Siegel theta function]], and in order to do that, we first need to define the [http://mathworld.wolfram.com/LogGammaFunction.html Log Gamma function]. This is not defined as the natural log of the Gamma function since that has a more complicated branch cut structure; instead, the principal branch of the Log Gamma function is defined as having a branch cut along the negative real axis, and is given by the series | ||
<math>\displaystyle \Upsilon(z) = -\gamma z - \ln z + \sum_{k=1}^\infty \frac{z}{k} - \ln(1 + \frac{z}{k})</math> | <math>\displaystyle \Upsilon(z) = -\gamma z - \ln z + \sum_{k=1}^\infty \frac{z}{k} - \ln\left(1 + \frac{z}{k}\right)</math> | ||
where the lower-case gamma is [[Wikipedia:Euler's constant|Euler's constant]]. We now may define the Riemann-Siegel theta function as | where the lower-case gamma is [[Wikipedia:Euler's constant|Euler's constant]]. We now may define the Riemann-Siegel theta function as | ||
Line 71: | Line 78: | ||
- \arctan\left(\frac{2t}{4n+1}\right)\right)</math> | - \arctan\left(\frac{2t}{4n+1}\right)\right)</math> | ||
Since the arctangent function is holomorphic in the strip with imaginary part between -1 and 1, it follows from the above formula, or arguing from the previous one, that | Since the arctangent function is holomorphic in the strip with imaginary part between -1 and 1, it follows from the above formula, or arguing from the previous one, that θ is holomorphic in the strip with imaginary part between -1/2 and 1/2. It may be described for real arguments as an odd real analytic function of ''x'', increasing when |''x''| > 6.29. Plots of it may be studied by use of the Wolfram [http://functions.wolfram.com/webMathematica/FunctionPlotting.jsp?name=RiemannSiegelTheta online function plotter]. | ||
Using the theta and zeta functions, we define the [[Wikipedia:Z function|Z function]] as | Using the theta and zeta functions, we define the [[Wikipedia:Z function|Z function]] as | ||
Line 77: | Line 84: | ||
<math>Z(t) = \exp(i \theta(t)) \zeta(1/2 + it)</math> | <math>Z(t) = \exp(i \theta(t)) \zeta(1/2 + it)</math> | ||
Since | Since θ is holomorphic on the strip with imaginary part between -1/2 and 1/2, so is Z. Since the exponential function has no zeros, the zeros of Z in this strip correspond one to one with the zeros of ζ in the critical strip. Since the exponential of an imaginary argument has absolute value 1, the absolute value of Z along the real axis is the same as the absolute value of ζ at the corresponding place on the critical line. And since theta was defined so as to give precisely this property, Z is a real even function of the real variable ''t''. | ||
Using the [http://functions.wolfram.com/webMathematica/FunctionPlotting.jsp?name=RiemannSiegelZ online plotter] we can plot Z in the regions corresponding to scale divisions, using the conversion factor ''t'' = 2π''x''/ln(2), for ''x'' a number near or at an edo number. Hence, for instance, to plot 12 plot around 108.777, to plot 31 plot around 281.006, and so forth. An alternative plotter is the applet [http://web.viu.ca/pughg/RiemannZeta/RiemannZetaLong.html here]. | Using the [http://functions.wolfram.com/webMathematica/FunctionPlotting.jsp?name=RiemannSiegelZ online plotter] we can plot Z in the regions corresponding to scale divisions, using the conversion factor ''t'' = 2π''x''/ln(2), for ''x'' a number near or at an edo number. Hence, for instance, to plot 12 plot around 108.777, to plot 31 plot around 281.006, and so forth. An alternative plotter is the applet [http://web.viu.ca/pughg/RiemannZeta/RiemannZetaLong.html here]. | ||
Line 99: | Line 106: | ||
== Mike Battaglia's expanded results == | == Mike Battaglia's expanded results == | ||
=== Zeta yields "relative error" over all rationals === | === Zeta yields "relative error" over all rationals === | ||
Above, Gene proves that the zeta function measures the [[Tenney-Euclidean_metrics|Tenney-Euclidean relative error]], sometimes called "Tenney-Euclidean Simple Badness," of any EDO, taken over all 'prime powers'. The relative error is simply equal to the tuning error times the size of the EDO, so we can easily get the raw "non-relative" tuning error from this as well by simply dividing by the size of the EDO. | Above, Gene proves that the zeta function measures the [[Tenney-Euclidean_metrics|Tenney-Euclidean relative error]], sometimes called "Tenney-Euclidean Simple Badness," of any EDO, taken over all 'prime powers'. The relative error is simply equal to the tuning error times the size of the EDO, so we can easily get the raw "non-relative" tuning error from this as well by simply dividing by the size of the EDO. | ||
Line 111: | Line 117: | ||
\zeta(s) = \sum_n n^{-s}</math> | \zeta(s) = \sum_n n^{-s}</math> | ||
Now let's do two things: we're going to expand s = σ+it, and we're going to multiply | Now let's do two things: we're going to expand s = σ+it, and we're going to multiply ζ(s) by its conjugate ζ(s)', noting that ζ(s)' = ζ(s') and ζ(s)·ζ(s)' = |ζ(s)|<span style="font-size: 90%; vertical-align: super;">2</span>. We get: | ||
<math> \displaystyle | <math> \displaystyle | ||
Line 440: | Line 446: | ||
}</math> | }</math> | ||
where the product is over all primes p. The product converges for values of s with real part greater than or equal to one, except for s=1 where it diverges to infinity. We may remove a finite list of primes from consideration by multiplying | where the product is over all primes p. The product converges for values of s with real part greater than or equal to one, except for s=1 where it diverges to infinity. We may remove a finite list of primes from consideration by multiplying ζ(s) by the corresponding factors (1-p^(-s)) for each prime p we wish to remove. After we have done this, the smallest prime remaining will dominate peak values for s with large real part, and as before we can track these peaks backwards and, by analytical continuation, into the critical strip. In particular if we remove the prime 2, (1-2^(-s))ζ(s) is now dominated by 3, and the large peak values occur near equal divisions of the "tritave", ie 3. | ||
Along the critical line, |1 - p^(-1/2-i t)| may be written | Along the critical line, |1 - p^(-1/2-i t)| may be written | ||
Line 453: | Line 459: | ||
=== Black magic formulas === | === Black magic formulas === | ||
When [[Gene_Ward_Smith|Gene Smith]] discovered these formulas in the 70s, he thought of them as "black magic" formulas not because of any aura of evil, but because they seemed mysteriously to give you something for next to nothing. They are based on Gram points and the Riemann-Siegel theta function | When [[Gene_Ward_Smith|Gene Smith]] discovered these formulas in the 70s, he thought of them as "black magic" formulas not because of any aura of evil, but because they seemed mysteriously to give you something for next to nothing. They are based on Gram points and the Riemann-Siegel theta function θ(t). Recall that a Gram point is a point on the critical line where ζ(1/2 + ig) is real. This implies that exp(iθ(g)) is real, so that θ(g)/π is an integer. Theta has an [[Wikipedia:asymptotic expansion|asymptotic expansion]] | ||
<math>\displaystyle{ | <math>\displaystyle{ | ||
Line 459: | Line 465: | ||
}</math> | }</math> | ||
From this we may deduce that | From this we may deduce that θ(t)/π ≈ r ln(r) - r - 1/8, where r = t/2π = x/ln(2); hence while x is the number of equal steps to an octave, r is the number of equal steps to an "e-tave", meaning the interval of e, 1200/ln(2) = 1731.234 cents. | ||
Recall that Gram points near to pure-octave edos, where x is an integer, can be expected to correspond to peak values of | | Recall that Gram points near to pure-octave edos, where x is an integer, can be expected to correspond to peak values of |ζ| = |Z|. We can find these Gram points by Newton's method applied to the above formula. If r = x/ln(2), and if n = floor(r ln(r) - r + 3/8) is the nearest integer to θ(2πr)/π, then we may set r⁺ = (r + n + 1/8)/ln(r). This is the first iteration of Newton's method, which we may repeat if we like, but in fact no more than one iteration is really required. This is the first black magic formula, giving an adjusted "Gram" tuning from the orginal one. | ||
For an example, consider x = 12, so that r = 12/ln(2) = 17.312. Then r ln(r) - r - 1/8 = 31.927, which rounded to the nearest integer is 32, so n = 32. Then (r + n + 1/8)/ln(r) = 17.338, corresponding to x = 12.0176, which means a single step is 99.853 cents and the octave is tempered to twelve of these, which is 1198.238 cents. | For an example, consider x = 12, so that r = 12/ln(2) = 17.312. Then r ln(r) - r - 1/8 = 31.927, which rounded to the nearest integer is 32, so n = 32. Then (r + n + 1/8)/ln(r) = 17.338, corresponding to x = 12.0176, which means a single step is 99.853 cents and the octave is tempered to twelve of these, which is 1198.238 cents. | ||
The fact that x is slightly greater than 12 means 12 has an overall sharp quality. We may also find this out by looking at the value we computed for | The fact that x is slightly greater than 12 means 12 has an overall sharp quality. We may also find this out by looking at the value we computed for θ(2πr)/π, which was 31.927. Then 32 - 31.927 = 0.0726, which is positive but not too large; this is the second black magic formula, evaluating the nature of an edo x by computing floor(r ln(r) - r + 3/8) - r ln(r) + r + 1/8, where r = x/ln(2). This works more often than not on the clearcut cases, but when x is extreme it may not; 49 is very sharp in tendency, for example, but this method calls it as flat; similarly it counts 45 as sharp. | ||
== Computing zeta == | == Computing zeta == | ||
Line 484: | Line 490: | ||
* [http://terrytao.wordpress.com/2009/07/12/selbergs-limit-theorem-for-the-riemann-zeta-function-on-the-critical-line/ Selberg's limit theorem] by Terence Tao [http://www.webcitation.org/5xrvgjW6T Permalink] | * [http://terrytao.wordpress.com/2009/07/12/selbergs-limit-theorem-for-the-riemann-zeta-function-on-the-critical-line/ Selberg's limit theorem] by Terence Tao [http://www.webcitation.org/5xrvgjW6T Permalink] | ||
* [[:File:Zetamusic5.pdf|Favored cardinalities of scales]] by Peter Buch | * [[:File:Zetamusic5.pdf|Favored cardinalities of scales]] by Peter Buch | ||
* [http://www.ams.org/journals/mcom/2004-73-246/S0025-5718-03-01568-0/S0025-5718-03-01568-0.pdf Computational estimation of the order of | * [http://www.ams.org/journals/mcom/2004-73-246/S0025-5718-03-01568-0/S0025-5718-03-01568-0.pdf Computational estimation of the order of ζ(1/2 + it)] by Tadej Kotnik | ||
* [https://www-users.cse.umn.edu/~odlyzko/zeta_tables/index.html Andrew Odlyzko: Tables of zeros of the Riemann zeta function] | * [https://www-users.cse.umn.edu/~odlyzko/zeta_tables/index.html Andrew Odlyzko: Tables of zeros of the Riemann zeta function] | ||
* [https://www-users.cse.umn.edu/~odlyzko/doc/zeta.html Andrew Odlyzko: Papers on Zeros of the Riemann Zeta Function and Related Topics] | * [https://www-users.cse.umn.edu/~odlyzko/doc/zeta.html Andrew Odlyzko: Papers on Zeros of the Riemann Zeta Function and Related Topics] | ||
* [https://www.lmfdb.org/zeros/zeta/?N=1&t=&limit=100 Zeros of Zeta] | * [https://www.lmfdb.org/zeros/zeta/?N=1&t=&limit=100 Zeros of Zeta] | ||
[[Category:Zeta| ]] <!-- | [[Category:Zeta| ]] <!-- Main article --> | ||
[[Category:Math]] | [[Category:Math]] | ||
[[Category:Tuning]] | [[Category:Tuning]] | ||
Line 496: | Line 502: | ||
[[Category:Pages with open problems]] | [[Category:Pages with open problems]] | ||
[[Category: | [[Category:Todo:increase_applicability]] | ||
[[Category: | [[Category:Todo:simplify]] |