Teaching
Teaching at Oberlin College:
- CSCI 151, Data Strcutures – Spring 2024, Spring 2025
- CSCI 280, Algorithms – Fall 2023, Spring 2024, Fall 2024, Spring 2025
Previous Teaching at Santa Clara University:
- Math 11, Calculus and Analytic Geometry I – Fall 2021
- Math 12, Calculus and Analytic Geometry II –Spring 2020, Winter 2021
- Math 12H, Calculus II Honors – Fall 2021, Fall 2022
- Math 30, Business Calculus I – Spring 2021
- Math 31, Business Calculus II – Spring 2022
- Math 36, Calculus for Life Sciences II – Winter 2020, Spring 2020, Winter 2022
- Math 51, Discrete Mathematics – Fall 2019
- Math 144, Partial Differential Equations – Spring 2022
- Math 155, Ordinary Differential Equations – Spring 2021
- CompSci/Math 166, Numerical Analysis – Wintero 2020, Winter 2021, Fall 2022
Previous Teaching at University of Michigan:
- Math 214, Applied Linear Algebra – Fall 2017, Spring 2019
- Math 215, Calculus III – Fall 2016
- Math 217, Linear Algebra – Winter 2017
- Math 450, Advanced Mathematics for Engineers – Winter 2019
- Math 471, Introduction to Numerical Methods – Winter 2018
Undergraduate Research Projects
I have openings for students who want to get involved in undergraduate research. If you are a student curious about research in applied mathematics or computer science, come talk to me! Here are some titles/descriptions of undergraduate research projects I have mentored:- Emma Riley Fink, Periodic Lines in Binary Tomography, (Summer 2021) – Riley studied a problem in binary tomography of reconstructing a binary matrix from projections along periodic lines in different directions. She came up with a conjecture on what combination of directions uniquely determine the matrix, along with strong supporting evidence. She wrote up her conjecture and results in a poster presentation.
- Nikolaus Elsaesser, Partially Ordered Sets with Inconsistent Pairs (PIPs) for Coloring Graphs, (Summer 2021) – Nik studied PIPs and their connection to median subgraphs of coloring graphs. He worked on an algorithm to detect whether a certain block of the graph was median or not. He wrote up his results in a technical report.
- Stephen Gibson, Reconfiguration System Definitions for Coloring Graphs , (Summer 2021) – Stephen worked on rigorous definitions for reconfiguration systems in the context of coloring graphs. He focused on the effects of the generators and their commutability. Stephen wrote a technical report summarizing his work and describing the important examples.
- Junhyun Lim, Symmetries and Nucleii for a Family of Coloring Graphs , (Summer 2021) – Junhyun studied a specific family of coloring graphs, and worked on proving that they contained multiple objects referred to as nucleii. This was written up in a technical report.
- Austin Rothschild, Fast Computation of the Inverse Born Series , (2020-2021) – Austin worked on an efficient algorithm for computing the inverse Born series to solve nonlinear inverse scattering problems. He was able to reconstruct sizeable 3D images. He wrote up his results in a technical report, and is currently contributing to a manuscript that will be submitted to a peer-reviewed journal.
- Pranav Rao, Finding Hypercubes in Coloring Graphs, (Summer 2020) – Pranav worked on an algorithm for finding hypercubes in coloring graphs. This combined aspects of graph theory and topology. Pranav detailed his findings in a poster presentation.
- Joseph Donato, Structured Iterative Hard Thresholding (2019-2020), – Joseph studied a variant of a classic sparsity alogirthm in the context of an inverse source problem. The results of this project contributed to a paper that is currently in the peer-review process.