Speakers
Keynote Speaker: Lindsay Erickson, Computational Mathematician at Moebius Logic
Unexpected Mathematics in Puzzles, Games, and Graphs
Abstract: Some mathematical questions begin with a surprisingly simple idea: Can you cross every bridge exactly once? Can you connect houses to utilities without crossing any lines? How many colors are needed to color a map? Can you find a winning strategy for a game that seems to depend entirely on luck?
Questions like these lead to mathematics that is far richer than the equations and formulas we typically encounter in school. In this keynote, mathematician Lindsay Erickson will explore graph theory, combinatorics, and game theory through a collection of puzzles and problems that reveal unexpected structures hiding in seemingly simple questions. Along the way, students will encounter graphs that cannot be drawn without crossings, discover surprising strategies for mathematical games, explore what happens when familiar ideas are pushed toward infinity, and see how mathematicians turn puzzles into new mathematics.
Lindsay will also share pieces of her own path through mathematics, including the problems and ideas that kept drawing her deeper into the subject. Her journey from student to researcher, professor, and computational mathematician illustrates one of the things she loves most about mathematics: the freedom to follow an interesting question wherever it leads.
Many of the ideas we will encounter were developed long before anyone could imagine the problems they would eventually help solve. Graph theory began with questions about bridges and maps; today, graphs are used to understand everything from computer networks to complex systems. Mathematics often gives us powerful ways of thinking long before we know what we will use them for. Sometimes the most interesting questions are the ones that seem, at first, to have no practical purpose at all.