T. Garrison

collaborators

3 papers

math.CO2026

New Upper bounds on the Mondrian Art Problem

Thomas Garrison, Chris Seiler, Aliaksei Semchankau

We present a new upper bound on the defect of the Mondrian Art Problem. The Mondrian Art Problem asks for a partition of an $n \times n$ square with rectangles of distinct dimensio…

math.CO2024

PackIt! Gamified Rectangle Packing

Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux

We present and analyze PackIt!, a turn-based game consisting of packing rectangles on an $n \times n$ grid. PackIt! can be easily played on paper, either as a competitive two-playe…

math.CO2024

Weakly Consecutive Sequences

Thomas Garrison, Chris Seiler, Andrew Knowles

A weakly consecutive sequence (WCS) is a permutation $σ$ of ${1, \dots, k}$ such that if an integer $d$ divides $σ (i)$ , then $d$ also divides $σ (i \pm d)$ insofar as these are d…