I am a sixth year PhD student under
Michael Saks. I am interested in discrete math and theoretical computer science.
Along with Aditya Potokuchi and Michael Saks, I coorganize the Theory of Computing Reading Seminar.
Please alert me by email when you find typos or mistakes in these lecture notes.
(TA, Fall 2016)
with Michael Saks (2018)
with Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson (2018)
[To appear, FOCS 2018][arXiv]
with Philip Chodrow, Brian Lins (2013)
A characterization theorem and algorithm to test, given positive semidefinite matrices P and Q and a completely positive map T, whether it is possible to pre- and post- compose T with matrix similarities so that T is both trace-preserving and maps P to Q. This generalizes the (r,c)-scaling problem, which asks, given a nonnegative matrix and vectors r and c, if the matrix can be pre- and post- multiplied by diagonals so that its row sums become r and the column sums become c.
How to determine whether three given positive-semidefinite matrices can arise as marginals of a pure state.
How best to play 20 questions and a little on the theory of large deviations.
How to fairly distribute goods and services among people who may not be honest about how much they value said goods and services.
How to save a 4/729 fraction of axis-parallel squares using infinite, straight-line cuts. Following the paper by Weise et. al.
Besikovitch's construction of sets in the unit cube with volume 0.1 and arbitrarily small surface area (first few steps at right).
Hill Center, Room 606
Department of Mathematics
Rutgers, The State University Of New Jersey
110 Frelinghuysen Rd.
Piscataway, NJ 08854-8019
email: wcf17 at math dot rutgers dot edu
wcf17 at math dot rutgers dot edu