<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Strong Secretary Conjecture is True for Linear Matroids · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2609.20797/</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/2609.20797/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Strong Secretary Conjecture is True for Linear Matroids — mentioned by NotOscarWilde</title><link>https://news.ycombinator.com/item?id=49927320</link><guid isPermaLink="false">urn:hackerpapers:mention:2609.20797:49927320</guid><pubDate>Thu, 01 Oct 2026 21:32:11 GMT</pubDate><description>&lt;p&gt;&amp;gt; It doesn&amp;#x27;t seem humanly possible to produce &amp;gt;2 &amp;quot;high SNR&amp;quot; papers per month. The situation right now is pretty crazy, for example this established TCS professor [1] has at least 4 arXiv submissions co-authored by him in September [2]. This includes the recent breakthrough on the matroid secretary problem, which has a pretty interesting AI story of its own, if you haven&amp;#x27;t seen it yet [3]. Of course prolific professors can work around this by working with younger researchers who upload the work, but this just makes the rate limit a solo author bottleneck, which feels a bit weird. [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2609.20797/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
