To constantly break through himself in the university, Guanzhong Yang embraces the new topics, faces the brand-new challenges, cooperates with ambitious colleagues, and pursues the life-long dreams.
Inspired by a conjecture relating to the lower bound on the chromatic number of a graph proposed by Wocjan and Elphick, Guanzhong Yang did further research to confirm its tightness with the help of matrix analysis, and successfully presented his work at the High School Poster Session of the 2025 International Congress of Basic Science in July 2025.
In September 2025, Guanzhong Yang participated in the 2025 Securing the Twenty-First Century Internet Conference held by the London Mathematical Society (LMS) and the Institute of Mathematics and its Applications (IMA). Through this conference, he gained the opportunity to communicate with professionals in the related fields in person.
During the conference, he studied the implementation of Fully Homomorphic Encryption (FHE) to achieve “usable but invisible” data and Differential Privacy mechanisms to prevent differential attacks, with a focus on real-world use cases.
In January 2026, Guanzhong Yang presented his poster called Euclidean Proof of the Infinitude of Primes in Arithmetics Sequences at Imperial College Directed Reading Programme Symposium. By utilizing the Galois group and the ring of algebraic integers, an integer-coefficient polynomial based on cyclotomic units is constructed. Through applying the Chinese Remainder Theorem to derive a contradiction, a Euclidean-style proof for the infinitude of primes in arithmetic progressions is then shown.
Each paper and conference record acts more than an academic entry. They mark moments where curiosity met rigor, and where solitary inquiry converged into shared insight.