https://hackerpaper.kaipfister.de/p/2104.04841/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=44889917urn:hackerpapers:mention:2104.04841:44889917Wed, 13 Aug 2025 15:40:09 GMT<p>Cool! This paper is also quite readable: https://arxiv.org/pdf/2104.04841 On p.2 they follow my idea of adding the lowest possible letter at the end, although they generalise it to adding the letter as close to the end as possible. They conjecture that this process does not stop. I&#x27;m always amazed with combinatorics how quickly you arrive at questions that no one knows the answer to.</p><p><a href="https://hackerpaper.kaipfister.de/p/2104.04841/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO