<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Improved bounds on the supremum of autoconvolutions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0907.1379/</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/0907.1379/feed.xml" rel="self" type="application/rss+xml" /><item><title>Improved bounds on the supremum of autoconvolutions — mentioned by qq12as</title><link>https://news.ycombinator.com/item?id=43987287</link><guid isPermaLink="false">urn:hackerpapers:mention:0907.1379:43987287</guid><pubDate>Wed, 14 May 2025 17:45:53 GMT</pubDate><description>&lt;p&gt;This is great. But how incremental are these advancements? I picked one at random (B.2 -- the second autocorrelation inequality). Then, I looked up the paper that produced the previous state of the art (https://arxiv.org/pdf/0907.1379). It turns out that the authors had themselves found the upper bound by performing a numerical search using &amp;quot;Mathematica 6&amp;quot; (p.4). Not only did the authors consider this as a secondary contribution (p.2), but they also argued that finding something better was very doable, but not worth the pain: &amp;quot;We remark that all this could be done rigorously, but one needs to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0907.1379/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CA</category></item></channel></rss>
