Michael Levet

Contact Information

  • Email Me: firstname (dot) lastname (at) colorado (dot) edu

Research Interests

  • Pure Math: Algebraic Combinatorics, Computational Group Theory, Computational Complexity, Quantum Computation, Spectral Graph Theory
  • Interdisciplinary: Microeconomic Theory, Game Theory

Publications:

  • Master's Thesis: “Graph Homomorphisms and Vector Colorings
  • Activity in Boolean Networks” - (with Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Henning S. Mortveit, and Sichao Wu), Journal of Natural Computing (2016).
  • “A Mechanism Design Approach For Influence Maximization” - (with Siddharth Krishnan, 2016 )
  • “Network Structure and Activity in Boolean Networks” - (with Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Henning S. Mortveit, and Sichao Wu), Cellular Automata and Discrete Complex Systems (2015).

Teaching Interests:

  • Linear and Abstract Algebra, Discrete Math, Number Theory, Theory of Computation, Theory of Combinatorial Circuits, Computational Complexity, Cryptography, Information Theory.

Courses Taught:

  • University of Colorado- Boulder
    • Fall 2019: CSCI 3104 Algorithms (GTA)
    • Fall 2019: CSCI 3434 Theory of Computation (Lead GTA)
    • Spring 2020: CSCI 3104 Algorithms (GTA)
    • Spring 2020: Math 3140 Abstract Algebra (GTA)
    • Fall 2020: CSCI 3104 Algorithms (GTA)
  • Johns Hopkins Center for Talented Youth
    • Summer 2018: Theory of Computation (TCOM) Instructor of Record
    • Summer 2018: Probability and Game Theory (GAME) Instructor of Record
    • Summer 2019: Fundamentals of Computer Science (FCPS) Instructor of Record (2 sessions)
    • Summer 2020: Proving What Can't Be Proven (PROV) Instructor of Record (4 sessions)
  • University of South Carolina- Columbia:
    • Fall 2015:
      • CSCE 145 Algorithmic Design I (GTA for one lab section)
      • CSCE 355 Foundations of Computation (GTA)
    • Spring 2016:
      • CSCE 146 Algorithmic Design II (GTA for one lab section)
      • CSCE 551 Theory of Computation (GTA)
    • Summer 2016:
      • CSCE 355 Foundations of Computation (Instructor of Record)
      • Graduate Tutor for Math Tutoring Center
    • Fall 2016: Math 142 Calculus II (GTA for two lab and recitation sections)
    • Spring 2017: Math 141 Calculus I (GTA for two lab and recitation sections)
    • Summer 2017: CSCE 355 Foundations of Computation (Instructor of Record)
    • Fall 2017: Math 115 Precalculus (Instructor of Record)
    • Spring 2018: Math 122 Business Calculus (Instructor of Record)
    • Fall 2018: Math 122 Business Calculus (Instructor of Record- 3 sections)
    • Fall 2018: Math 170 Finite Mathematics (Instructor of Record- 1 section)
    • Spring 2019: Math 122 Business Calculus (Instructor of Record- 1 section)
    • Spring 2019: Math 141 Calculus I (Instructor of Record- 1 section)
    • Spring 2019: Math 170 Finite Mathematics (Instructor of Record- 2 sections)
    • Summer 2019: Math 111 College Algebra (Instructor of Record- 1 section)
  • Virginia Tech:
    • Fall 2014: CS 4124 Theory of Computation (UTA)
    • Spring 2015: CS 4114 Formal Languages and Automata Theory (UTA)
  • My Notes

    I welcome comments, suggestions, and corrections. Please reach out to me via email with any feedback you may have regarding my notes.

    Book Recommendations

    • A First Course in Proofs
    • Favorite Combinatorics and Graph Theory Books
      • Bijective Combinatorics - Nicholas Loehr
      • Introduction to Graph Theory - Douglas West
      • Algebraic Graph Theory - Chris Godsil and Gordon Royle
      • An Introduction to the Theory of Graph Spectra- Dragoš M. Cvetković, Peter Rowlinson, and Slobodon Simić
      • Linear Algebra Methods in Combinatorics With Applications to Geometry and Computer Science- Laszlo Babai and Peter Frankl
    • Theory of Computation and Algorithms
      • Introduction to Algorithms- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
      • Computational Complexity: A Modern Approach- Sanjeev Arora and Boaz Barak
      • Models of Computation- John E. Savage
      • Introduction to the Theory of Computation - Michael Sipser
      • Introduction to Automata Theory, Languages and Computation (1st Edition)- John E. Hopcroft and Jeffrey D. Ullman.
      • Introduction to Automata Theory, Languages and Computation (3rd Edition)- John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman
      • Remark: The 1st Edition of Hopcroft and Ullman's text is a beautifully written book full of a lot of important material. However, it is really geared at a mathematically mature audience. The 3rd edition is more watered down in terms of the material, but the authors emphasize proof strategy. The later edition is more appropriate for an audience with minimal proofs-based mathematics.
    • Linear Algebra
      • Linear Algebra- Stephen H. Friedberg, Arnold J. Insel, and Lawrence E. Spence
      • Advanced Linear Algebra- Nicholas Loehr
    • Abstract Algebra
    • Microeconomics and Game Theory