<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Circle Squaring with Pieces of Small Boundary and Low Borel Complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2202.01412/</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/2202.01412/feed.xml" rel="self" type="application/rss+xml" /><item><title>Circle Squaring with Pieces of Small Boundary and Low Borel Complexity — mentioned by arutar</title><link>https://news.ycombinator.com/item?id=30266036</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.01412:30266036</guid><pubDate>Tue, 08 Feb 2022 22:54:54 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m not sure why this is not mentioned in the article, but there is nothing special about circles and squares (or 2 dimensions, for that matter). If anything, phrasing it like this gives the (misleading) impression that somehow features of squares and circles are important! The authors proved [1, Thm. 1.3] that given any two sets in R^d with equal non-zero measure and boundaries that are &amp;quot;not too horrible&amp;quot; (i.e. box / Minkowski dimensions of their boundaries less than d), one can cut one of the sets into finitely many Borel pieces and rearrange them (i.e. apply isometries in R^d) to obtain…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.01412/"&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>
