Hello! I am a graduate student working on extremal combinatorics at Yonsei University, Department of Mathematics.
My main research interests are graph homomorphism inequalities, particularly approaches to Sidorenko’s conjecture.
Since March 2026, I have been enrolled in M.S./Ph.D. integrated course. My advisor is Prof. Joonkyung Lee.
Email: ingyubaek@yonsei.ac.kr
Photo from KSCW 2025
Yonsei University
graduate (March 2026–Present)
M.S./Ph.D. integrated course
undergraduate (March 2022–February 2026) graduated with high honors
B.S. Computer Science and Engineering
B.S. Mathematics
Theory of Computation lab, Undergraduate Intern (June 2023–August 2024)
Artificial Intelligence and Information Systems Lab, Undergraduate Intern (September 2024–October 2024)
Combinatorics@Yonsei, Undergraduate Intern (November 2024–February 2026)
Seoul Science High School
(2019-2021)
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem, with Joonghyuk Hahn, Yo-Sub Han and Kai Salomaa, In Proceedings of the 28th International Conference on Developments in Language Theory (DLT'24), LNCS 14791, 68--81, 2024 [LINK]
The Parikh matrix is a morphism from the monoid of words to matrices. Unlike Parikh vector (i.e. abelianization) which captures how many times specific character has appeared in a given word, Parikh matrix counts more sophisticated combinatorial patterns of the word. Since the introduction of the Parikh matrix, how sharp the Parikh matrix identifies the given word was considered as a major research interest.
This paper provides the first general characterization of when two words have the same Parikh matrix, which has been open for more than 20 years. Previously, the characterization was known only for the alphabet of size 2 or 3. The extended version of this paper is under submission.
2025 Combinatorics Workshop [LINK]
(August 18, 2025) Contributed Talk: Counting loose odd cycles in dense hypergraphs
This talk is about joint work with Joonkyung Lee. Preprint concerning the contribution of this talk is not yet uploaded on arXiv.
28th International Conference on Developments in Language Theory (DLT 2024) [LINK]
(14, August) Universal rewriting rules for the Parikh Matrix injectivity problem