I am an Omidyar Fellow at the interdisciplinary Santa Fe Institute; my "home discipline" is (theoretical) computer science. My research lies primarily at the intersection of theoretical computer science and mathematics—particularly algebraic geometry, representation theory, and group theory—but I am starting to branch out into more general complex systems and, thereby, more worldly pursuits such as biology, energy, and the environment (which I've been interested in for most of my career).
What's new(July 14, 2015) You can listen to my interview by @Samuel_Hansen for the Strongly Connected Components podcast. My segment starts at 40:45, but you should also listen to the preceding interviews with my colleagues Yoav Kallus and Sid Redner!
(July 7, 2015) New paper posted: Polynomial-time isomorphism test of groups that are tame extensions (joint w/ Youming Qiao).
(May 9, 2015) The final, significantly expanded and edited version of Unifying known lower bounds via geometric complexity theory has now appeared in Computational Complexity, and is freely available forever (thanks to funding from SFI).
(Apr 21, 2015) Gave a CS colloquium at UNM: The role of symmetry (or the lack thereof) in algorithms and computational complexity.
(Sep 29, 2014) New paper posted: A framework for optimal high-level descriptions in science and engineering—preliminary report (joint w/ David H. Wolpert, Eric Libby, and Simon DeDeo). Particularly because this draft is a (very) preliminary report, we are circulating and soliciting comments and suggestions. Any and all are very welcome. (My first science paper outside of TCS!)
(Sep, 2014) Welcome to the world, little CFG!