• Jack Hanke, Michael Maltenfort. Enumeration of Messy Polygon Mosaics (2025).

🚧 Working on it! 🚧

• Jack Hanke. Minimal Inscribed Polyforms (2023).

Abstract: A polyomino is a shape in the plane constructed by joining unit squares along their edges. The question of how many polyominos there are with n unit squares is a famous unsolved problem in combinatorics. This has lead many to study polyomino families, which are polyominos with additional rules that must be adhered to in construction. One such family is the minimally inscribed polyominos. This paper extends this family to other lattices, and gives novel formulae for multiple minimal inscribed polyforms.

Though not published, I include my undergraduate honors thesis in this list due to the work I put towards this writeup.