We develop a new, random walk-based, algorithm for the Hamiltonian cycle problem. The random walk is on pairs of extreme points of two suitably constructed polytopes. The latter are derived from ...

As mathematical abstractions go, graphs are among the simplest. Scatter a bunch of points in a plane. Connect some of them with lines. That’s all a graph is. And yet they are incredibly powerful. They ...

This maze of jagged curls looks like something out of the world’s hardest puzzle book. How fast do you think you can solve it? Stuck? Don’t worry. It’s actually more of a connect the dots puzzle. The ...

Lecture Notes-Monograph Series, Vol. 30, Statistics, Probability and Game Theory: Papers in Honor of David Blackwell (1996), pp. 45-63 (19 pages) In 1962 Blackwell derived the partial Laurent's series ...

A team of physicists has created a maze that they claim is the most difficult, using a pattern from the game of chess to make the structure. To the untrained eye, the maze looks like the most ...

Physicists have done a remarkable job explaining the chaos of the universe with well-behaved equations, but certain situations remain mysterious. Among these are collections of many tiny particles — ...