Mathematical Activities

Papers:

An Alternative Technique for Proving the Aztec Diamond Theorem and Other Applications . (For the original bare-bones version, see New proof that the number of tilings for an Aztec diamond is 2^(n(n+1)/2) .
Applications of Graphical Condensation for Enumerating Matchings and Tilings . Theoretical Computer Science, Vol. 319/1-3 (2004) pp. 29-57. Also available in the arXiv at http://arxiv.org/abs/math.CO/0304090 . Discusses matchings of planar bipartite graphs, Aztec diamonds, and plane partitions.
Viterbi Sequences and Polytopes . Journal of Symbolic Computation, Vol. 41 No.2 (2006) pp. 151-163. Also available in the arXiv at http://arxiv.org/abs/math.CO/0401342 . Discusses Viterbi paths of Markov Chains and their combinatorial properties.
Geometry of Markov Chains. Algebraic Statistics for Computational Biology , ed. Lior Pachter and Bernd Sturmfels, Chapter 10.
Graphical Condensation Generalizations Involving Pfaffians and Determinants. (preprint)
An Identity about a Generating Function Based on Plane Partitions.
Approximate Alignments in Rectangular Arrays (draft).

Talks:

Graphical Condensation and Plane Partitions: PDF slides of a talk given March 1, 2004 at the Berkeley Combinatorics Seminar .
Viterbi Sequences and Polytopes : Qualification Exam, April 20, 2004.

Education:

University of California, Berkeley, Ph.D. in Computer Science, 2005.
Massachusetts Institute of Technology (MIT) , B.Sc. 1999.

Programs and Research:

Ph.D. research in algebraic statistics/combinatorics advised by Lior Pachter
Tilings Research Group , run by James Propp while at MIT.
Director's Summer Program at the Department of Defense.
Math Olympiad Summer Program
Young Scholar's Program at Rose-Hulman Institute of Technology
Center for Talented Youth

Competitions:

Other links:

The Mathematical Assocation of America
BAD Math Day : BAD stands for "Bay Area Discrete".

Back to home .