I put up a post over at the StackOverflow blog describing a little of what I’ve been up to this summer. Curiously enough, the Zipf distribution which shows up in that post is the same as the zeta distribution that shows up when trying to motivate the definition of the Riemann zeta function. I’m sure [...]
Posts Tagged ‘zeta functions’
Update
Posted in shameless plugs, statistical mechanics, tagged universality, zeta functions on July 21, 2011 | 1 Comment »
A little more about zeta functions and statistical mechanics
Posted in number theory, probability, statistical mechanics, tagged partition functions, zeta functions on November 14, 2010 | 1 Comment »
In the previous post we described the following result characterizing the zeta distribution. Theorem: Let be a probability distribution on . Suppose that the exponents in the prime factorization of are chosen independently and according to a geometric distribution, and further suppose that is monotonically decreasing. Then for some real . I have been thinking [...]
Zeta functions, statistical mechanics and Haar measure
Posted in group theory, measure theory, number theory, probability, statistical mechanics, tagged compactness, partition functions, profinite groups, q-analogues, universal properties, zeta functions on November 9, 2010 | 3 Comments »
An interesting result that demonstrates, among other things, the ubiquity of in mathematics is that the probability that two random positive integers are relatively prime is . A more revealing way to write this number is , where is the Riemann zeta function. A few weeks ago this result came up on math.SE in the [...]
The cyclotomic identity and Lyndon words
Posted in algebraic combinatorics, number theory, tagged finite fields, Frobenius map, Lyndon words, MaBloWriMo, zeta functions on November 3, 2009 | 5 Comments »
In number theory there is a certain philosophy that is a good toy model for the integers . The two rings share an important property: they are basically the canonical examples of Euclidean domains, hence PIDs, hence UFDs. However, many number-theoretic questions involving prime factorization over are much easier than their corresponding questions over . [...]