Curved Crease Sculptures by Erik and Martin Demaine:
The shapes remind me of the Danse Serpentine.
Curved Crease Sculptures by Erik and Martin Demaine:
The shapes remind me of the Danse Serpentine.
The MAA recently displayed a mathematical petting zoo at the USA Science & Engineering Festival, along with a slideshow of pictures from their MAA Found Math collection.
The page about the event doesn’t have any pictures on it but it does have lots of links to the artists and their portfolios. The usual suspects are represented — non-orientable manifolds and polyhedra are in abundance — but there are a couple of unfamiliar objects, and they’re all pleasing to look at and think about.
(via MAA Found Math on Flickr)
The Science Museum in London have created a Facebook timeline of Alan Turing’s life and events afterwards. It’s an excellent use of the new Timeline feature – you can scroll up and down the timeline from Turing’s birth to the current day, which contains plenty on his codebreaking and work with early computers as well as more mundane things like his schooling and the invention of the very first chess-playing computer program. Appropriately, his tragic death is a small footnote to a fascinating life, just a couple of lines. Scrolling back up towards the present, you can see how Turing’s reputation was restored and commemorated, leading up to 2012, the Alan Turing Year.
Some cognitive scientists have done an experiment on some people in Papua New Guinea to test the hypothesis that the number line is based on an in-built intuition that all humans share. They concluded that it isn’t, and that you can use cardinal numbers without placing them mentally on a line.
The “Futurama theorem”, also known as Keeler’s Theorem after its creator, was a bit of maths invented for the Futurama episode The Prisoner of Benda, to solve a problem where the characters get their heads mixed up and need to swap them back without any one pair swapping heads twice. It was enthusiastically reported by the geeky press, and rightly so, because it’s a fun bit of real maths with a wonderful application. Dana Ernst has written some very good slides about the theorem, working from “what is a permutation?” up to the algorithm itself.
Anyway, some students from the University of California, San Diego have extended the result, giving a better algorithm for finding the minimum number of switches to put everyone’s head back in the right places, give optimal solutions for two particular situations, and give necessary and sufficient conditions for it being possible to represent the identity permutation as $m$ distinct transpositions in $S_n$.
Paper: http://arxiv.org/abs/1204.6086
via James Grime