Charles Kenney, Rutgers University

Abstract

Can a rectangle be tiled by finitely-many squares of distinct side lengths, which are almost-disjoint (intersect only at the boundary)? It turns out that this recreational math problem of squaring a rectangle can be related to electrical networks. We'll use graph theory to deduce a necessary condition, originally due to Dehn, for a rectangle to be squared.