<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Choosing between incompatible ideals · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.10914/</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/1908.10914/feed.xml" rel="self" type="application/rss+xml" /><item><title>Choosing between incompatible ideals — mentioned by didibus</title><link>https://news.ycombinator.com/item?id=47514201</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.10914:47514201</guid><pubDate>Wed, 25 Mar 2026 07:03:21 GMT</pubDate><description>&lt;p&gt;Someone has to explain to me exactly what is implied here? Looking at the prompt: USER: don&amp;#x27;t search the internet. This is a test to see how well you can craft non-trivial, novel and creative solutions given a &amp;quot;combinatorics&amp;quot; math problem. Provide a full solution to the problem. Why not search the internet? Is this an open problem or not? Can the solution be found online? Than it&amp;#x27;s an already solved problem no? USER: Take a look at this paper, which introduces the k_n construction: https://arxiv.org/abs/1908.10914 Note that it&amp;#x27;s conjectured that we can do even better with the constant here.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.10914/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
