https://www.scientificamerican.com/article/mathematics-world-mourns-maryam-mirzakhani-only-woman-to-win-fields-medal/

This was hard to write. I don't know how to do justice to such an impressive mathematician and person. I know in the coming weeks and months we will see many more remembrances of Mirzakhani that will fill out and expand on the articles written immediately in the wake of her death.

Today I learned there is an "Open Problem Garden", which appears to be a mostly derelict wiki listing open problems and progress on them. I wish something like this were more user friendly and actively maintained, and I have half a mind to do it myself...

How to fold a bunny: https://www.youtube.com/watch?v=GAnW-KU2yn4

From Erik Demaine and Tomohiro Tachi's work showing that any 3d triangulated surface can be folded from origami; MIT press release at http://news.mit.edu/2017/algorithm-origami-patterns-any-3-D-structure-0622 and SoCG 2017 paper at http://erikdemaine.org/papers/Origamizer_SoCG2017/

The theoretical computer science (TCS) community just launched a new conference: the Symposium on Simplicity in Algorithms (SOSA)

While simplicity is always appreciated in mathematics and TCS, it's never been so explicitly encouraged. I'll be looking forward to see what simplifications come out of this.

https://windowsontheory.org/2017/06/17/the-1st-symposium-on-simplicity-in-algorithms-guest-post/

The mathematical paintings of Crockett Johnson, artist best known for Harold and his purple crayon:

http://www.atlasobscura.com/articles/crockett-johnson-math-art-paintings-harold-purple-crayon

In fact, one of the primary tools in the process being debated in this case is the use of a mathematical measure called the Efficiency Gap. More here: https://arxiv.org/pdf/1705.10812.pdf

This is huge! The supreme court is going to hear a case on partisan gerrymandering, in which they may rule about what process (including what mathematical techniques) can be used in a case that a partisan gerrymander is illegal.

http://www.cnn.com/2017/06/19/politics/supreme-court-partisan-gerrymandering/index.html

This is going to happen in October, just after I attend the Gerrymandering Workshop at Tufts. Exciting times!

A tweep suggests it's a cuboctahedron with diagonals drawn in on some of the squares. https://en.wikipedia.org/wiki/Cuboctahedron

I spent longer than I care to admit searching for it in the list of Johnson solids before realizing it can't be a Johnson solid because it has 6 triangles around some vertices, which would lie flat if they were equilateral.

https://www.instagram.com/p/BVhlNfCHiCG/ https://mathstodon.xyz/media/GoLT-gr5AAaQmuZPbGw

Buckets of fish! http://jdh.hamkins.org/buckets-of-fish/

A cute combinatorial game that always eventually terminates, despite the players' ability to make games arbitrarily long. And despite the infinite game tree, there's a simple trick that makes its strategy easy.

Help wanted : We're looking for examples of the terms and conditions that the different Mastodon instances have used. Are they collected somewhere, or do we need to visit each instance separately and collect/collate them "by hand"?

We're looking for something close to what we want and which can then be twoke for our needs.

Suggestions?

TIA.

I get a cube illusion when I look at this tiling. But I just realized maybe I shouldn't because this is not a look that's possible w/cubes. No face of a cube looks like a square unless you're looking at it straight on & then you don't see other sides. I guess that trip to the Picasso Museum must have worked! #cubes #cubism #getit

https://mathstodon.xyz/media/SCNgom-_B2mFd7ZhPrs

#foundmath Encountered a sink (stable fixed point) on my apple this morning. :) https://mathstodon.xyz/media/CVnhRDdvMSlGsTPzxII

#proofinatoot The probability that a power of 2 starts with the digit d is $log(d+1) - log(d)$.

Observe that $2^n$ has first digit d if there is some non-negative integer k such that $d10^k \leq 2^n < (d+1)10^k$.

Applying the base 10 logarithm to this inequality, we get $log(d) + k \leq nlog(2) < log(d+1) + k$.

Taking the fractional part of this inequality, we get $log(d) \leq \{nlog(2)\} < log(d+1)$.

But by Weyl's Criterion, $\{nlog(2)\}$ is equidistributed in [0,1). The result follows.

An approximation is “a not-right estimate of a right answer,” Kaplan says, whereas “a near-miss is an exact representation of an almost-right answer.”

http://nautil.us/issue/49/the-absurd/the-impossible-mathematics-of-the-real-world

Math and science writer. Complex analysis fangirl. Black lives matter. http://blogs.scientificamerican.com/roots-of-unity/

Joined Jun 2017