Penrose tilings are beautiful. They look spectacular, have a host of miraculous properties, and deep connections to fundamental areas of mathematics and computer science. And they also define funky grids on which we can reinvent a host of famous puzzles and games!
Peg solitaire is as simple as it is infuriating. Not least because when playing the infamous French variant, the game is impossible! But hidden just below the surface are some connections with linear programming, Diophantine equations, and the mysteriously named Fredholm alternative…
The long nights of Swedish winter tend to send one a little insane. Hence the arrival of the unashamedly silly, Epic Pythagoras. But I also had a somewhat educational message that I wanted to share on proof by contraposition…
We go on whistle stop tour of one of the most fundamental tools from control theory: the Lyapunov function. But with a twist from combinatorics and topology.
Test and trace offers a promising path to halt the spread of an infectious disease in its tracks. But how accurate does the testing need to be? And how fast must cases be traced? In this video we offer the control theorist’s perspective, and investigate what stability theory and the fundamental limits of feedback have to say.
Test-and-trace offers a promising path to stop an outbreak in its tracks. But how accurate does it need to be? And how fast must cases be traced?
We all know that log(abc)=log(a)+log(b)+log(c). But when does log(a+b+c)=log(a)+log(b)+log(c)?