Statistical Paradoxes—interactive demonstrations of why seemingly obvious conclusions don't necessarily follow when examining real-world data.
Spectral Approach to Polytope Diameter—upper bounds on graph diameter of a polytope in two settings: (1) worst-case for integer polytopes with short bit description (2) smoothed unit polytopes. arxiv ITCS Conference slides talk
Smoothed analysis of the condition number under low-rank perturbations—adding a random rank k matrix to a fixed matrix of rank n-k produces a well-conditioned matrix. arxiv RANDOM Conference
Determinants of binary matrices achieve every integral value up to Omega(2^n/n)—exactly as the title states. An explicit construction is provided. arxiv Linear Algebra and its Applications
Becoming the world's highest rated chess player—if n chess players starting with equal rating play a total of k games, how high could one possibly be rated after the games? Please let me know if you have an idea of where to submit this! arxiv
Sloan Sports Analytics Conference—treated basketball players as points traveling relative to a gradient of the `basket probabiltiy' function which assigns the probability of making a shot to each location on the court.
HackMIT 2018—created graphical user interface for constructing & training neural networks, with fast iteration of network architecture and ability to export in industry standard format. [First Place Grand Prize Winner]
HackMIT 2017—created image enhancer that increases resolution and recovers detail from pixelated images without using machine learning or image databases. [First Place Grand Prize Winner]
NBA Hackathon—created tool to examine player matchups and optimal defender location on court throughout the game. [Third place winner]
Student Colloquium for Undergraduates in Mathematics—Just Guess! The Strength and Versatility of the Probabilistic Method.
Abstract: When showing constructions with particular properties exist, it is tempting to start trying to construct something with those properties. One alternative approach is to randomly construct something and show there’s a nonzero probability it ends up with the desired properties. Sometimes, this perspective can lead to algorithms which are guaranteed to produce `good’ constructions. notes
Mathematics Undergraduate Student Assocication "Math Monday"—same topic as the SCUM talk.
Intransitive game—There's an elegant characterization of every symmetric, zero-sum game, which may be intransitive in general (e.g. rock-paper-scissors). In particular, all payoffs are determined by a difference between two simple inner products. I've implemented a visualization of a random instance of such a game being played between many players; I also wrote a brief proof that the characterization always works.
Boids—classic boids simulation written in js and rendered using svg. Interestingly, not a single 'boid' implementation I was able to find online used the two key details outlined in the original SIGGRAPH paper here. Namely, strength of repulsion is given by an inverse square law, and accleration is determined based on prioritized allocation. I find they dramatically improve the simulation!
Discrete analysis seminar—click the link for details, contact me for the password for the zoom link and video recordings.