<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Math on Jeffrey R. Fetzer</title><link>http://jrf.io/categories/math/</link><description>Recent content in Math on Jeffrey R. Fetzer</description><generator>Hugo -- 0.147.0</generator><language>en-us</language><lastBuildDate>Tue, 12 May 2026 20:00:00 -0600</lastBuildDate><atom:link href="http://jrf.io/categories/math/index.xml" rel="self" type="application/rss+xml"/><item><title>Manimations: Animated Math with Manim</title><link>http://jrf.io/posts/manimations/</link><pubDate>Tue, 12 May 2026 20:00:00 -0600</pubDate><guid>http://jrf.io/posts/manimations/</guid><description>&lt;p>A collection of mathematical animations built with &lt;a href="https://www.manim.community/">Manim&lt;/a>. Each one visualizes a concept from fractal geometry or dynamical systems.&lt;/p>
&lt;h3 id="box-counting-dimension">Box-Counting Dimension&lt;/h3>
&lt;p>Estimates the fractal dimension of a binary image by overlaying grids at progressively finer scales and counting how many cells contain structure. The box-counting dimension is the slope of the log-log regression:&lt;/p>
$$d = \lim_{r \to 0} \frac{\log N(r)}{\log(1/r)}$$&lt;p>where $N(r)$ is the number of boxes of size $r$ that intersect the fractal. The animation sweeps through grid sizes from 4 to 128, plotting each $(log(1/r),\ \log N(r))$ point in real time and fitting the line at the end.&lt;/p></description></item></channel></rss>