MattSuperdock

My email is msuperdo at andrew.cmu.edu.

CV (updated Feb. 2021)


About me.

I am a math PhD student in the Algorithms, Combinatorics, and Optimization group at Carnegie Mellon University. My recent research has involved applying topological methods to problems in combinatorics and other areas. I am also interested in type theory, formal verification, and automated reasoning.

I study math because I find it beautiful in its simplicity and complexity; as a Christian, I find that math reflects in a fundamental way the glory of God in all of creation. As Proverbs says, "It is the glory of God to conceal things, but the glory of kings is to search things out."

Before beginning my PhD studies, I graduated from Princeton in '13 and taught calculus and computer science for three years at Charles E. Jordan High School in Durham, North Carolina. My wife Allie is a pediatrics resident at the UPMC Children's Hospital in Pittsburgh.

Publications.

A nonlinear Lazarev-Lieb theorem: L2-orthogonality via motion planning (pdf)
With Florian Frick.
Journal of Topology and Analysis, to appear.

A new infinite class of ideal minimally non-packing clutters (pdf)
With Ahmad Abdi, Gérard Cornuéjols.
Discrete Mathematics, to appear.

Clean tangled clutters, simplices, and projective geometries (pdf)
With Ahmad Abdi, Gérard Cornuéjols.
(submitted)

Software.

The links below are Github repositories:

agda-unused - Check for unused code in an Agda project (Haskell).

vim-agda - Asynchronous type-checking for Agda 2.6.1 (Vimscript).

vim-foldout - Outline-based folding with syntax highlighting (Vimscript).