Bernardo Anibal Subercaseaux Roa
Marijn Heule. He has a background in engineering and is passionate about mathematics and computer science. Bernardo's research attacks the following question from a variety of angles: what can and cannot be done (efficiently?) by a computer? Today, Bernardo joined us to talk about Packing Chromatic, a fascinating research area at the intersection of pure mathematics and SAT solving. Bernardo and his advisor recently solved an open problem in the space, finding the packing chromatic number for the infinite 2D grid. We discussed the proof and a bunch of related problems, including some intriguing (and open) questions about periodic vs aperiodic tilings. By the way, this work was also covered (briefly) in the NYT! (Not a lot of 2nd year PhD students get covered in the grey lady!!)
