Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Periodic complementary binary sequences and Combinatorial Optimization algorithms
Speaker: Ilias Kotsireas, Wilfrid Laurier University
Date: Thursday, March 5, 2009 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
We establish a new formalism for problems pertaining to the periodic and non-periodic autocorrelation functions of finite sequences, which is suitable for Combinatorial Optimization methods. This allows one to bring to bear powerful Combinatorial Optimization methods in a wide array of problems that can be formulated via these two functions. Joint work with C. Koukouvinos, P. M. Pardalos, O. V. Shylo, JOCO, to appear.