Speaker
Mr
Alexey Medvedev
(Sobolev Institute of Mathematics, Novosibirsk, Russia)
Description
Two scenarios are known to get prefix-reversal Gray codes. The
first one was given by S. Zaks in 1984 [BIT, 24, 196-204], and the second one was suggested by A. Williams and J. Sawada in 2013 [Electronic Notes in Discrete Math., 44, 357-362]. In this talk we consider other approaches for obtaining prefix-reversal Gray codes. It was noticed that both constructions are based on the independent small even cycles in the Pancake graph. We provide the series of these cycles and study the existence of prefix-reversal Gray codes on them.
Primary author
Mr
Alexey Medvedev
(Sobolev Institute of Mathematics, Novosibirsk, Russia)
Co-author
Dr
Elena Konstantinova
(Sobolev Institute of Mathematics)
