<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Seven Trees in One · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_9405205/</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/math_9405205/feed.xml" rel="self" type="application/rss+xml" /><item><title>Seven Trees in One — mentioned by cvoss</title><link>https://news.ycombinator.com/item?id=40418848</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9405205:40418848</guid><pubDate>Mon, 20 May 2024 18:57:25 GMT</pubDate><description>&lt;p&gt;The connection between type isomorphisms and algebraic equalities is known and explored in a variety of interesting ways. I don&amp;#x27;t know the precise history of the development of the notation and vocabulary, but there&amp;#x27;s a reason types like A+B are notated with a plus symbol and called &amp;quot;sums&amp;quot;. Similarly for products. And it may surprise you (or not) to learn that people sometimes call A -&amp;gt; B an exponential type, and even notate it with superscript notation. One of my favorites is the result that the binary tree type is isomorphic to septuples of binary trees, which you can arrive at by using the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9405205/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>Seven Trees in One — mentioned by enricozb</title><link>https://news.ycombinator.com/item?id=34359381</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9405205:34359381</guid><pubDate>Thu, 12 Jan 2023 19:53:32 GMT</pubDate><description>&lt;p&gt;Some related links (specifically that they perform &amp;quot;high school&amp;quot; algebra on types): - Seven trees in one [0], a paper showing a bijection between binary trees and seven-tuples of binary trees. - The algebra of algebraic data types [1] discusses Taylor expansions of data types. - Differentiation of higher-order types [2] is commenting on OP&amp;#x27;s paper. I used to be really interested in type theory, but haven&amp;#x27;t had as much time to explore it, but over the years I&amp;#x27;ve saved these links (and the one posted). [0]: https://arxiv.org/pdf/math/9405205.pdf [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9405205/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>Seven Trees in One — mentioned by svat</title><link>https://news.ycombinator.com/item?id=33153453</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9405205:33153453</guid><pubDate>Mon, 10 Oct 2022 16:34:27 GMT</pubDate><description>&lt;p&gt;A very nice fact that I coincidentally learned just yesterday, which is not in the linked answer but is touched on in one of the comments and in an edit on the accepted answer: there is an explicit bijection that maps a binary tree to seven binary trees (and vice-versa, by the inverse function). Consider the definition of a binary tree: &amp;quot;a binary tree is either empty, or is a root with a left tree and a right tree&amp;quot;. This we can write as T = 1 + T² Solving the analogous equation z = 1 + z² in the complex numbers gives z to be a primitive sixth-root of unity…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9405205/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>Seven Trees in One — mentioned by mathgenius</title><link>https://news.ycombinator.com/item?id=23588231</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9405205:23588231</guid><pubDate>Sat, 20 Jun 2020 23:12:28 GMT</pubDate><description>&lt;p&gt;If you like that then you are going to love this: &amp;quot;Seven Trees in One&amp;quot; by Andreas Blass. https://arxiv.org/abs/math/9405205&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9405205/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>Seven Trees in One — mentioned by gjm11</title><link>https://news.ycombinator.com/item?id=9777123</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9405205:9777123</guid><pubDate>Thu, 25 Jun 2015 11:27:33 GMT</pubDate><description>&lt;p&gt;A few remarks on this stuff. 1. Very closely related is the pure-mathematical technique of generating functions, where you take a sequence (let&amp;#x27;s say the Fibonacci sequence 0,1,1,2,3,5,8,13,...) and use its elements as coefficients in a power series (0+1x+1x^2+2x^3+3x^4+5x^5+8x^6+13x^7+...) and then notice that (e.g.) shifting the sequence by 1 is the same as multiplying by x, so if F is the series for (f(n)) then x.F is the series for (f(n-1)) and x^2.F is the series for (f(n-2)) apart from some corrections for very small n, which gets you F=(x+x^2)F+x or F = x/(1-x-x^2), and now you can…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9405205/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item></channel></rss>
