
Joint work with Petr Gregor (Charles University).
We show that simple greedy algorithms can generate Gray codes of the associated combinatorial objects. For example, greedily moving the largest possible ball into the bin containing the smallest possible ball creates the Gray code for set partitions originally due to Kaye in 1976.
Joint work with Roop Pal (rpal15@simonsrock.edu).