<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Discrete Complex Analysis and Probability · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1009.6077/</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/1009.6077/feed.xml" rel="self" type="application/rss+xml" /><item><title>Discrete Complex Analysis and Probability — mentioned by mrcactu5</title><link>https://news.ycombinator.com/item?id=14138798</link><guid isPermaLink="false">urn:hackerpapers:mention:1009.6077:14138798</guid><pubDate>Tue, 18 Apr 2017 13:54:59 GMT</pubDate><description>&lt;p&gt;example 12, &amp;quot;Tiling a Rectangle by Squares&amp;quot; is rather unique; it was discussed in Stanislav Smirnov&amp;#x27;s Fields medal lecture in 2010 https://en.wikipedia.org/wiki/Squaring_the_square In his lecture he puts the square tilings in a rather serious context (the theory of electrical networks) https://arxiv.org/abs/1009.6077 ( Discrete Complex Analysis and Probability )&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1009.6077/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math-ph</category></item></channel></rss>
