Thu, January 25, 2018
10:20 am - 11:15 am
Cockins Hall 240
Title: Polyominoes with maximally many holes
Speaker: Érika Roldán Roa (Ohio State University and Centro de Investigación en Matemáticas, Mexico)
Abstract: A polyomino is a finite collection of squares with vertices in the lattice $\mathbb{Z}^2$ and with a connected interior. Given a number $n\ge 1$, what is the maximum number $f(n)$ of holes that a polyomino with $n$ squares can enclose? We find $f(n)$ exactly for infinitely many $n$. The main construction is a recursive sequence that leads to fractal-like polyominoes
Seminar URL: http://u.osu.edu/probability