<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>How long is the Chaos Game? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2007.11517/</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/2007.11517/feed.xml" rel="self" type="application/rss+xml" /><item><title>How long is the Chaos Game? — mentioned by arutar</title><link>https://news.ycombinator.com/item?id=29703166</link><guid isPermaLink="false">urn:hackerpapers:mention:2007.11517:29703166</guid><pubDate>Mon, 27 Dec 2021 15:21:40 GMT</pubDate><description>&lt;p&gt;This is fair - there are a decent number of details omitted here. However, a lot of the details are hidden inside the proof that an IFS has a unique fixed point. At least to me, this &amp;quot;proof&amp;quot; is nice because it converts a non-obvious procedure (taking midpoints) into a &amp;quot;standard&amp;quot; procedure (the IFS construction). A sketch of the argument in the IFS goes like this: consider the set of maps {f1, f2, f3} as acting on compact subsets of R^2 by the action F -&amp;gt; f1(F) U f2(F) U f3(F). Since the maps fi are continuous, the image is a compact set. But one can also prove that this action is a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2007.11517/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.DS</category></item></channel></rss>
