Boris
Princeton math *08

Boris Alexeev

I am a graduate student in mathematics at Princeton interested in some mix of algebra, combinatorics, and complexity. I am supported by the NSF graduate research fellowship.

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

There are also many things I do not do.

Contact info

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

Coauthors

Jameson Cahill (Missouri), Michael Forbes (MIT), Jacob Fox (MIT), Alexandra Fradkin (CCR Princeton), Ron Graham (San Diego), Ilhee Kim (Princeton), Dustin Mixon (Princeton), Jacob Tsimerman (Harvard), and Rachel Ward (Texas)

Papers

Each paper title below links to more detailed information. General information about all of my papers is also available.

PDF logoForbidden induced subgraphs of double-split graphs
(with Alexandra Fradkin and Ilhee Kim)
SIAM Journal on Discrete Mathematics 26 (2012), no. 1, 1–14
PDF logoAn analysis of a war-like card game
(with Jacob Tsimerman)
American Mathematical Monthly, to appear.
PDF logoFull spark frames
(with Jameson Cahill and Dustin Mixon)
Submitted, Oct 2011.
PDF logoTensor rank: some lower and upper bounds
(with Michael Forbes and Jacob Tsimerman)
IEEE Conference on Computational Complexity 26 (2011), 283–291.
PDF logoOn the complexity of Mumford-Shah type regularization, viewed as a relaxed sparsity constraint
(with Rachel Ward)
IEEE Transactions on Image Processing 19 (2010), no. 10, 2787–2789.
PDF logoEquations resolving a conjecture of Rado on partition regularity
(with Jacob Tsimerman)
Journal of Combinatorial Theory, Series A 117 (2010), no. 7, 1008–1010.
PDF logoOn minimal colorings without monochromatic solutions to a linear equation
(with Jacob Fox and Ron Graham)
Combinatorial Number Theory, de Gruyter, Berlin, 2007, pp. 1–22.
PDF logoOn lengths of rainbow cycles
Electronic Journal of Combinatorics 13 (2006), no. 1, R105, 14 pp.
PDF logoMinimal DFA for testing divisibility
Journal of Computer and System Sciences 69 (2004), no. 2, 235–243.

Notes

PDF logoA direct proof of Mulmuley's weak #P versus NC result
(with Jacob Tsimerman)
Note, Feb 2009.