Boris Alexeev

I am a graduate student in mathematics at Princeton interested in computational complexity theory and combinatorics. I am supported by the NSF Graduate Research Fellowship.

I co-organize the annual UGA high school math tournament in Athens, Georgia.

Contact info

Email: bale...@math.princeton.edu (username is first initial and last name)
Office: 104 Fine Hall, Washington Rd, Princeton NJ 08544.

Boris Alexeev and Jacob Tsimerman. Equations resolving a conjecture of Rado on partition regularity, Journal of Combinatorial Theory, Series A, to appear. (arXiv:0812.1314)
Boris Alexeev, Jacob Fox, and Ron Graham. On minimal colorings without monochromatic solutions to a linear equation, Combinatorial number theory, de Gruyter, Berlin, 2007, pp. 1–22. (MR2337035)
Boris Alexeev. On lengths of rainbow cycles, Electronic Journal of Combinatorics 13 (2006), no. 1, R105, 14 pp. (arXiv:math/0507456, MR2274320)
Boris Alexeev. Minimal DFA for testing divisibility, Journal of Computer and System Sciences 69 (2004), no. 2, 235–243. (arXiv:cs/0309052, MR2077381, CR130797)

Boris Alexeev and Jacob Tsimerman. A direct proof of Mulmuley's weak #P versus NC result, note, Feb 2009.
Boris Alexeev and Jacob Tsimerman. An analysis of a war-like card game, note, Nov 2009.