This project has been such a privilege to be a part of and the highlight of my career so far. I'm looking forward to continuing this beautiful collaboration and friendship! 💚

We have also created a digital catalog inspired by the Knot Atlas implementing our algorithms to solve the smallest cases of the problem: https://t.co/SAWXoYLjnx 📷

The third version of our paper in topology/computer science with Christopher-Lloyd Simon is now available on the arxiv: https://t.co/o0oo0ophob

Life Universe https://t.co/DLCTLNTqII Explore the infinitely recursive universe of Game of Life! Works in real-time and is perfectly consistent, never fails to remember where you are and where you came from. 無限に再帰するライフゲームの宇宙を探索できる作品を作りました #indiedev

Going with Topology Through Inquiry next sem. Just started reading in depth but I appreciate the topics on cardinality (Schröder–Bernstein, CH, ordinals...). Didn't see these in undergrad; we were assumed to be familiar in grad so I'm glad they're here. I like this ex: @mathyawp

https://t.co/5hKw8pG43g

Here's a famous--and mighty curious--way to multiply two numbers: "parabolic multiplication." My question, just for intellectual curiousity (not pedagogy) is just how much does this model "explain"?

Teaching Monty Hall in discrete structures tomorrow and wondering if part of the reason people get confused by it is that P( you win | you switch *randomly* ) = 1/2

Annoys me when schools (looking at you, MIT) want 1) Rec letters to follow their own specific format in the letter body 2) For me to differentiate between top 0.01%, top 0.1%, and top 1% of my students. Hate ranking students and I don't even have enough data for that precision.

Any recommendations for undergraduate topology textbooks? I love Stephen Abbott's Understanding Analysis for teaching real analysis. If anyone has used that and can recommend a similar style of book for topology, that would be especially ideal.

Proof outline: 1) rdigsum( n ) = n mod 9 (with 0 replaced by 9; follows from the rule for divisibility by 9) 2) n mod 9 is a ring homomorphism from Z -> Z/9 3) rdigsum( 19n ) = rdigsum( 19 )*rdigsum( n ) = rdigsum( n ) So it's not just 1; this works for any x with 1 = x mod 9

One of my students conjectures an interesting property about the number 19. No proof yet. Let rdigsum( n ) be the result of recursively summing the digits of n, e.g. rdigsum( 585 ) = rdigsum( 5+8+5 ) = rdigsum( 18 ) = 9 For all integers n, rdigsum( 19*n ) = rdigsum( n )

Context:

Seemed like a good year to go as spooky action at a distance👻

Lol there's a Spotify playlist called "Not Pulk/Pull" with every Radiohead song except Pulk/Pull Revolving Doors. What the hell do they have against my fav Radiohead song?

Download and run this file to add "open command prompt here" option to right-click folder context menu (Windows 10): https://t.co/sIfbE5Xo5a Small little thing but a game changer if you use any Windows command-line utilities. (instructions modified from https://t.co/eMcrVzox0W)

Putting it all together, here's a desmos demo which shows the stereographic circumcenters of a given three points: https://t.co/27c0qRZ8vw A final riddle: Why does "winding" (x_3,y_3) around the other two points cause the two centers to trace out a circle? What is that circle?

Procrastinating other math by making a circumcircle calculator: https://t.co/TEcFscY6Ot It's made by calculating the intersection of two perpendicular bisectors of the triangle formed by the three points. There are just some spurious divisions by 0 that need to be cleaned up.

Is getting retweeted by bots just a normal twitter thing?

Which makes me a bit sad, because as far as I can tell there's no way of computing or really getting my hands on any non-principal ultrafilter.