fae @fae@witches.town

@Alda strongly support suspending. i'm on witches partly bc it's been good about publicly blocking unsafe instances. "the admin harasses ppl and then jokes about it later" is a definite deal-breaker for me, and the fact that it's a large instance actually makes it worse -- they have influence, and will certainly keep pushing boundaries in the future with an admin like that.

i seem to have a rough draft of a one-sheet geometry zine
https://witches.town/media/shZpTQ_OSIG3PZnkCZA

announcement: conflicting definitions having fallen into disuse, the new word for "equilateral triangle" is "trice"

"equilateral triangle" is such a shitty term, you wouldn't put up with saying "equilateral quadrangle" for "square", why is the superior shape denied justice

guess who got a fucking polynomial bound
https://witches.town/media/POBalumxj5Bhhy4McYY

omg it me
https://witches.town/media/cej7rKqy5jQknzg1afw

if there's anything i am known for it is my laser focus

my working notebook: selected excerpts
https://witches.town/media/BIVYFsANGl2EuX-dSf4
https://witches.town/media/_MLklwnHMROeFUzEkmQ
https://witches.town/media/BAVKgnzgT7ODG4tRHQA
https://witches.town/media/81k-NOUKaQer0_ezN4U

very very good progress last night, and fortunately i remembered it when i woke up. weekend goal will likely be extracting explicit numeric bounds from this idea.
https://witches.town/media/n33wBjJxyEli5tEItSc

the thunderstorms in the forecast tomorrow better be for real

@Nire you gotta keep em federated

e.g. a sierpinski triangle, one copy of size n is the same as 3 copies of size n/2, giving the recursive "bound" f(n) = 3f(n/2)

which expands to a tree of height log_2 n, with weight tripling at each level, so:
f(n) = 3^(log_2 n) = n^(log 3 / log 2)

which you would see in most algorithms classes as a runtime bound, but geometrically this means the "dimension" of the sierpinski triangle is log 3 / log 2

I now have all the billiard paths I could ask for, now I just need to improve the path verification to handle longer paths (2-3x current limit) in a feasible time bound \o/

today in triangles: the fancy pruning advanced pathfinding thingamajig that is guaranteed to find all paths up to a certain length isn't nearly as effective in practice as just trying a bunch of random directions and seeing if any of them work.

mathematicians write like they're doing an autopsy report

@colon_three if i can ask, what program is that screenshot from?