Danny Scheinerman, Rutgers University

Abstract

We will describe the classical Gray code and some of its nice properties. We can generalize Gray codes as walks generally through a collection of objects where each step the adjacent objects are close in some way. We'll see some examples and open problems. Hopefully this talk won't be too painful. Unless you're into that sort of thing.