1 citations · 1 across the 6 of their papers we have counts for
7 papers
Unfolding Boxes with Local Constraints
Long Qian, Eric Wang, Bernardo Subercaseaux +1
We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, incl…
Automated Symmetric Constructions in Discrete Geometry
Bernardo Subercaseaux, Ethan Mackey, Long Qian +1
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discoveri…
Pentagon Minimization without Computation
John Mackey, Bernardo Subercaseaux
Erdős and Guy initiated a line of research studying , the minimum number of convex -gons one can obtain by placing points in the plane without any three of them bein…
Formal Verification of the Empty Hexagon Number
Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio +3
A recent breakthrough in computer-assisted mathematics showed that every set of points in the plane in general position (i.e., without three on a common line) contains an empt…
Assortment Optimization For Conference Goodies With Indifferent Attendees
Fernanda Gutiérrez, Bernardo Subercaseaux
Conferences such as FUN with Algorithms routinely buy goodies (e.g., t-shirts, coffee mugs, etc) for their attendees. Often, said goodies come in different types, varying by color…
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 grid. PackIt! can be easily played on paper, either as a competitive two-playe…
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
Bernardo Subercaseaux, John Mackey, Marijn J. H. Heule +1
We present a comprehensive demonstration of how automated reasoning can assist mathematical research, both in the discovery of conjectures and in their verification. Our focus is a…