<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Dirichlet Series for the Liouville Function and the Riemann Hypothesis · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1609.06971/</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/1609.06971/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Dirichlet Series for the Liouville Function and the Riemann Hypothesis — mentioned by gjm11</title><link>https://news.ycombinator.com/item?id=20000925</link><guid isPermaLink="false">urn:hackerpapers:mention:1609.06971:20000925</guid><pubDate>Fri, 24 May 2019 12:53:52 GMT</pubDate><description>&lt;p&gt;I have looked at Eswaran&amp;#x27;s paper that purports to prove RH and I&amp;#x27;m pretty sure it&amp;#x27;s all wrong. (Currently-latest version of paper is here: https://arxiv.org/pdf/1609.06971v10.pdf) The basic idea is to prove that a certain function L(N) doesn&amp;#x27;t grow too quickly. It&amp;#x27;s true that appropriate bounds on L(N) imply RH. But Eswaran&amp;#x27;s arguments for this point are full of handwaving, and in this field handwaving is just not good enough. L(N) is a sum of terms +1 and -1, and he claims that it behaves like a series of coin tosses, but the specific ways he argues it&amp;#x27;s like a series of coin tosses are not…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1609.06971/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item><item><title>The Dirichlet Series for the Liouville Function and the Riemann Hypothesis — mentioned by sandeepeecs</title><link>https://news.ycombinator.com/item?id=19679542</link><guid isPermaLink="false">urn:hackerpapers:mention:1609.06971:19679542</guid><pubDate>Wed, 17 Apr 2019 03:33:00 GMT</pubDate><description>&lt;p&gt;its there on arxiv. https://arxiv.org/pdf/1609.06971v4.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1609.06971/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item><item><title>The Dirichlet Series for the Liouville Function and the Riemann Hypothesis — HN submission</title><link>https://news.ycombinator.com/item?id=12889009</link><guid isPermaLink="false">urn:hackerpapers:submission:1609.06971:12889009</guid><pubDate>Mon, 07 Nov 2016 05:29:40 GMT</pubDate><description>&lt;p&gt;A possible proof for Riemann Hypothesis&lt;/p&gt;&lt;p&gt;I work with a professor,Dr. Kumar Eswaran, on several computer science problems especially in the neural network field. He is the quintessential prof who is always lost in thought and interested in solving unsolvable problems. So I was pleasantly surprised last week when he told me that he had found a proof for the Riemann Hypothesis. The Professor was able to crack the Riemann Hypothesis because he used the properties of primes and analytic continuation and had a new way of handling slowly converging series and was able to use (at crucial point) concepts borrowed from Donald Knuth regarding…&lt;/p&gt;&lt;p&gt;3 points; 10 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1609.06971/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item></channel></rss>
