معرفی
Peter Nelson is an Associate Professor in the Department of Combinatorics and Optimization at the University of Waterloo, Canada. He currently serves as the Associate Chair for Undergraduate Studies, coordinating academic advising and managing departmental operations. His research focuses on structural and extremal matroid theory, graph theory, and their connections to coding theory, additive combinatorics, and finite geometry. He holds an NSERC Discovery Grant and has contributed to foundational work on matroid minors, binary matroid classification, and combinatorial enumeration. His recent interests include formalizing proofs in the LEAN theorem prover.
Education: Ph.D. in Mathematics (University of Waterloo, 2008) with a thesis titled *Exponentially dense matroids*. His academic journey includes postdoctoral research and teaching roles prior to his current position.
Research Interests:
- Structural matroid theory (e.g., minor-closed classes, forbidden configurations)
- Binary matroid extremal problems
- Applications to coding theory and additive combinatorics
- Formal proof systems like LEAN
Advising & Grants: As Associate Chair, he oversees undergraduate academic advising via coundergrad.officer@uwaterloo.ca. His NSERC grant supports investigations into matroid density and extremal configurations. He has collaborated extensively with institutions globally, including co-authoring over 40 peer-reviewed publications.
Labs/Teams: Active member of the Combinatorics and Optimization research group at Waterloo, contributing to collaborative projects on matroid theory and discrete mathematics.
