Tiling with Monotone Polyominos

AbstractA monotone polyomino is a set of grid cells pierced by a continuous monotone function f:[a,b]→R. We prove that the minimum number of monotone polyominos in a tiling of the n×n lattice square is n. Surprisingly, this turns out to be equivalent with the statement that every triangulation of the n×n lattice square into minimum lattice triangles contains at least 2n right angled triangles.MSC: 05B5005B45 ACKNOWLEDGMENTSThe author wishes to thank Christian Richter and the anonymous referees for their useful comments and suggestions.Additional informationNotes on contributorsIstván TomonISTVÁN TOMON received his Ph.D. in mathematics from the University of Cambridge. He spent several years as a postdoctoral student at the EPFL and ETH Zurich. Currently, he is an Associate Professor at Umeå University, pursuing research in combinatorics and related areas.