Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title:Transfer-Matrix Method as a Combinatorial Hammer: Enumeration of Silent Circles, Graph Cycles, and Seating Arrangements
Speaker: Max Alekseyev, George Washington University
Date: Thursday, April 28, 2016 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
Abstract:
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.