Colloquium: Max Alekseyev (George Washington U)

February 21, 2020 @ 3:30 pm – 4:00 pm
Keller 401

SPEAKER: Max Alekseyev (George Washington U)
Transfer-Matrix Method as a Combinatorial Hammer:
Enumeration of Silent Circles, Graph Cycles, and Seating Arrangements

I will discuss application of the transfer-matrix method to a variety
of enumeration problems concerning the party game “silent circles”,
Hamiltonian cycles in the antiprism graphs, simple paths/cycles in
arbitrary graphs, and generalized menage problem. While this method
does not always lead to nice formulas, it often provides an efficient
way of computing the corresponding quantities.

Max Alekseyev is an Associate Professor of Mathematics and
Computational Biology at the George Washington University. He holds
M.S. in mathematics (1999) and Ph.D. in computer science (2007), and
is a recipient of the NSF CAREER award (2013) and the John Riordan
prize (2015). Dr. Alekseyev’s research interests range from discrete
mathematics (particularly, combinatorics and graph theory) to
computational biology (particularly, comparative genomics and genome
assembly). He is an Editor-in-Chief of the Online Encyclopedia of
Integer Sequences (