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 ...

Taiwanese Journal of Mathematics, Vol. 10, No. 2, Special Issue: Proceedings of the International Conference on Analysis and Its Applications, 2004 (February 2006), pp. 327-338 (12 pages) In this note ...

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 ...