Email: dev [dot] guoj [at] gmail [dot] com


I am a MSc student in Mathematics at Universität Regensburg, previously in the ALGANT program. I am very fortunate to be working under the guidance of Prof. Radu Curticapean, on the topic of counting graph homomorphisms. I am also looking for doctoral positions in extremal combinatorics and theoretical computer science!

I am generally interested in extremal and probabilistic combinatorics, statistical physics, number theory, and their applications to theoretical computer science and data science. For more information, see my research page. My Erdős number is 2.

I graduated from the University of Utah in Spring, 2020. I also spent an semester at the Math in Moscow program and another at the Budapest Semesters in Mathematics program, for which Department of Mathematics of the University of Utah wrote an article.

I am a contributor of the open-source mathematics software SageMath, especially its algebraic geometry and graph theory components. I also write other software, have run two half-marathons in Shanghai in 2014 and in Hong Kong in 2016, and also have run the Chicago Marathon in 2017. When I am not studying or working, I generally enjoy reading, playing chess and Weiqi/Go, and photography.


  • count-graph-homs: Count graph homomorphisms effortlessly in SageMath for fun! 🚀