I am a postdoc at IT University of Copenhagen, working under Radu Curticapean. I am interested in the theory of counting problems on graphs, including Holant, #CSP, and counting graph homomorphisms. Specifically, what can we learn about these problems by expressing them as tensor network contractions and applying tools from multilinear algebra, invariant theory, and other areas? I am also interested in quantum computing, especially as it relates to counting problems and tensor networks.
I recently completed my PhD at the University of Wisconsin-Madison, advised by Professor Jin-Yi Cai. You can find my PhD thesis here (slides).
I completed a B.S. and M.S. in Computer Science and B.A. in Mathematics at Case Western Reserve University in 2021, advised by Professor Harold Connamacher. My M.S. thesis studied the connections between totally symmetric and medial quasigroups and Abelian groups.