Colloquium: Prof. José Luis Ramírez
October 9 @ 2:00 pm - 3:00 pm
From Polyominoes to Fibonacci and Catalan Numbers
Polyominoes are simple geometric objects that lead to many interesting and sometimes surprisingly difficult problems in discrete mathematics and theoretical computer science. In this talk, I will introduce polyominoes and discuss two classical questions: tiling problems and the enumeration of polyominoes. I will then focus on a recent family of staircase polyominoes that leads to unexpected connections with two of my favorite integer sequences: the Fibonacci and Catalan numbers. If time permits, I will conclude with some open problems and possible directions for further research.
Check here for more information!
