About
My name is Minghui Ouyang (欧阳铭晖 in Chinese). I am a Ph.D. candidate at the School of Mathematical Sciences, Peking University, advised by Prof. Chunwei Song. I expect to graduate in 2026. I received my B.S. from Peking University with a double major in Mathematics and Computer Science in 2021. My research interests lie in combinatorics and theoretical computer science.
Email: ouyangminghui1998@gmail.com
Publications and Preprints
-
Sharp Bounds on k-wise Generalizations of Oddtowns and Eventowns.
With Zichao Dong and Lan Wei.
Preprint. [arXiv] -
Multicolor Erdős–Rogers Functions.
With Hong Liu and Haoran Luo.
Submitted. [arXiv] -
Property O and Erdős–Szekeres Properties in Linear Hypergraphs.
With Suyun Jiang and Ander Lamaison.
Submitted. [arXiv] -
On Relative Ordered Turán Density.
With Dylan King, Bernard Lidický, Florian Pfender, Runze Wang, and Zimu Xiang.
Submitted. [arXiv] -
Set Families: Restricted Distances via Restricted Intersections.
With Zichao Dong, Jun Gao, Hong Liu, and Qiang Zhou.
Math. Proc. Camb. Philos. Soc., published online, 2026. [DOI] -
On Restricted Sumsets with Bounded Degree Relations.
Minghui Ouyang.
Mathematika 71 (2025), no. 4, Paper No. e70045. [DOI] -
Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming.
Qian Li, Minghui Ouyang, Tian Ding, Yuyi Wang, Qingjiang Shi, Ruoyu Sun.
International Conference on Learning Representations (ICLR), 2025. [Proceedings] -
VC-dimensions between Partially Ordered Sets and Totally Ordered Sets.
With Boyan Duan and Zheng Wang.
Order, 43, Article 9, 2026. [DOI] -
On the Power of Small-size Graph Neural Networks for Linear Programming.
Qian Li, Tian Ding, Linxin Yang, Minghui Ouyang, Qingjiang Shi, Ruoyu Sun.
Conference on Neural Information Processing Systems (NeurIPS), 2024. [Proceedings] -
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems.
With Qian Li and Yuyi Wang.
International Symposium on Algorithms and Computation (ISAAC), LIPIcs 322, Article 45, 2024. [DOI] -
When Can an Expander Code Correct Ω(n) Errors in O(n) Time?
With Kuan Cheng, Chong Shangguan, and Yuanting Shen.
International Workshop on Randomization and Computation (RANDOM), LIPIcs 317, Article 61, 2024. [DOI]
IEEE Trans. Inf. Theory 71(10): 7626–7643, 2025. [DOI] -
Improved Decoding of Expander Codes.
With Xue Chen, Kuan Cheng, and Xin Li.
Innovations in Theoretical Computer Science Conference (ITCS), LIPIcs 215, 43:1–43:3, 2022. [DOI]
IEEE Trans. Inf. Theory 69(6): 3574–3589, 2023. [DOI]