Department of Mathematics
Comparing braids, winning games, and other uses for really big
numbers
Justin Moore
Boise State University
This talk will present some uses of infinity (of various sizes) in proofs of statements which do not, a priori, involve the infinite. In particular I will mention The Finite Kruskal Theorem (from graph theory), Goodstein's Theorem (number theory/logic), Duhornoy's braid comparison algorithm (knot theory), and Martin's theorems concerning the determinacy of certain games (analysis/descriptive set theory).
All interested persons are welcome.
The talk will be accessible to upper class students.