claude

making art with maths and algorithms

website: https://mathr.co.uk
code: https://code.mathr.co.uk
pronouns: he/him/his

Last Notes

2026-04-13 14:54:25 UTC

- reply

https://en.wikipedia.org/wiki/File:Circle-trig6.svg is a nice diagram of lots of trigonometric functions

2026-04-08 17:37:15 UTC

experiment exploring #MandelbrotSet #fractals #MathArt adding layers of cauliflowers to mini mandelbrots by choosing where to zoom
locations:
-1.74968481650579377858075949782979923
-1.749684816504354894259770797352982820550801324341230434823606
zoom of the second one with 8 layers is about 1e44, didn't save the zoom level of the first (with 3 layers)
I think I can generalize the way I found them (I constructed specific external angles expressed as periodic binary exansions, and traced their external rays towards the minibrots)
(apologies for the poor image quality)
https://post.lurk.org/system/media_attachments/files/116/370/265/805/518/928/original/3e8383f574322511.png
https://post.lurk.org/system/media_attachments/files/116/370/266/788/401/820/original/4ccd9bb5c92e877e.png

2025-06-03 11:13:38 UTC

#audio #LiveCoding #syntax #zine #OpenCall
https://cyberflemme.org/csc/
> Cyberflemme and the Cookie Collective join forces to create a collaborative fanzine dedicated to the syntax of audio livecoding.
> A simple track has been composed.
> 🎯 Your mission: reproduce it using your favorite livecoding software.
deadline got extended for a week (until 9th June), so I submitted an attempt with #Clive #C #DSP , which ended up a little over 100 lines of code.

2025-02-10 07:52:35 UTC

- reply

https://post.lurk.org/@mathr/113977128871458153 is my attempt from this weekend, animated 3D sections orthographically projected to 2D, of a randomly oriented triangular duoprism (T×T) rotating slowly in 4D. each line in the image corresponds to a 2D face of the 4D shape (afaict it's highly unlikely for a randomly oriented 2D face in 4D to give a 2D result when intersected with a 3D hyperplane)

2024-10-30 20:34:50 UTC

thinking about floating point and accuracy tradeoffs in numerical computation.
binary floating point is steppy, with gaps between representable numbers occasionally doubling.
wondering if log-domain would work better/worse in different applications? instead of mantissa and exponent, just have a fractional base and put everything in the exponent.
should make possible smoother tradeoffs between precision and range.
probably not feasible to implement in hardware though. might try some experiments some time with low precision using lookup tables.