Math 4980 (Spring 02015)



Final Projects

  • Benjamin DiSalle: Ramsey’s Theorem (paper | presentation)
  • Curtis Dlouhy: Möbius Inversions and their Applications (paper | presentation)
  • Leanne Hinrichs: Sorting Algorithms and Run-Time Complexity (paper | presentation)
  • Sarah Oligmueller: Generating Functions and the Fibonacci Sequence (paper | presentation)
  • Frankie Smith: The Matrix Tree Theorem and its Applications to Complete and Complete Bipartite Graphs (paper | presentation)