<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Seven mutually touching infinite cylinders · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1308.5164/</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/1308.5164/feed.xml" rel="self" type="application/rss+xml" /><item><title>Seven mutually touching infinite cylinders — mentioned by lifthrasiir</title><link>https://news.ycombinator.com/item?id=7538298</link><guid isPermaLink="false">urn:hackerpapers:mention:1308.5164:7538298</guid><pubDate>Sat, 05 Apr 2014 20:19:46 GMT</pubDate><description>&lt;p&gt;It is not a matter of rational numbers, since the solution is likely to be an irrational number. The paper [1] describes a system of 20 polynomial equations with 20 variables (Equations 10--12) and solving them is no trivial task. To the end, authors first numerically found candidate solutions up to some ten decimal digits [2] and used specialized tools to prove (!) that there exists a real solution sufficiently close to given numerical solution. It turns out that there are several ways (and corresponding implementations) to do that, e.g. alphaCertified [3]. [1] http://arxiv.org/abs/1308.5164…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1308.5164/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.MG</category></item></channel></rss>
