Join us at 3 PM on Friday, January 25, to hear from Jeff Hirst on accomplishments from his fall semester research assignment.
Abstract: The first part of this talk discusses the mechanics of my fall research assignment. This includes the obligatory travel photos, lists of talks and publications, and strategies for obtaining travel funding from sources across campus. The second part of the talk illustrates some of the content of the associated research. Given a sequence of hypergraphs, how hard is it to select those with a two coloring? We answer this question using the framework of reverse mathematics. This is joint work with Caleb Davis, Jake Pardo, and Tim Ransom. If time permits, I will also introduce some recent work on Weihrauch reducibility and related results.