Espen Slettnes
I am a Stanford Online High School student who loves math. Since sixth grade, I've been concurrently enrolled at the University of California, Berkeley, taking mathematics, physics, and economics courses. I am also a staff member of the Berkeley Math Circle (BMC), where I've been an instructor for the advanced group since 2018 and a problem writer for its monthly contests since 2020.
I have been researching combinatorics through the MIT PRIMESUSA internship program since January 2018. When I am not exploring math, you can find me coding various projects, improvising on the piano, or jumping on a trampoline.
My past research projects include:

Minimal Embedding Dimensions of Rectangle kVisibility Graphs
(January 2018August 2019)
E. Slettnes. Journal of Graph Applications and Algorithms, Vol. 25, no. 1, pp. 5996, January 2021. DOI: 10.7155/jgaa.00550, ISBN: 15261719. Mentor: Dr. Jesse Geneson of San Jose State University.
Explore the 3D models from this paper.

Extracting Tree Statistics from the Quasisymmetric Bernardi Polynomial (March 2020)
L. Cai, E. Slettnes, and J. Zhou; Mentor: Dr. Duncan Levear of MIT.

Expected Capture Time and Throttling Number for Cop versus Gambler (May 2019)
J. Geneson, C. Quines, E. Slettnes, and S. Tsai. arXiv: 1902.05860

Variations of the Cop and Robber Game on Graphs (October 2017)
E. Slettnes, C. Quines, S. Tsai, and J. Geneson. arXiv: 1710.11352
Selected awards and recognitions: