<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Integers and Prime Numbers: Deriving Zipf's Law · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2403.12773/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2403.12773/feed.xml" rel="self" type="application/rss+xml" /><item><title>Integers and Prime Numbers: Deriving Zipf's Law — mentioned by Xmd5a</title><link>https://news.ycombinator.com/item?id=49022594</link><guid isPermaLink="false">urn:hackerpapers:mention:2403.12773:49022594</guid><pubDate>Thu, 23 Jul 2026 14:51:18 GMT</pubDate><description>&lt;p&gt;The link is between numbers and words. Both can be decomposed into primitive components: primes and lyndon words (combinatorics). The Zipf distribution takes this shape when the vocabulary is infinite: P(r)=r^-s / Zeta(s) with s &amp;gt; 1 Replace r^-s with (r + a)^-s, i.e. move onto Mandelbrot&amp;#x27;s rank-shifted model of Zipf&amp;#x27;s law and Riemann&amp;#x27;s Zeta function becomes Hurwitz Zeta function (ZetaHurwitz(s,a+1) with the ranks starting at 1). Zipf law != Zipf distribution, still this is intriguing. Integers and Prime Numbers: Deriving Zipf&amp;#x27;s Law (https://arxiv.org/abs/2403.12773) &amp;gt; In a prime number…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2403.12773/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>physics.soc-ph</category></item></channel></rss>
