• 上官冲，山东大学数学与交叉科学研究中心教授、博导，山东大学杰出中青年学者。分别于2012年6月、2017年6月获得浙江大学数学学院理学学士、博士学位，博士导师为葛根年教授。毕业后于2017年8月至2020年7月在以色列特拉维夫大学从事博士后研究工作，合作导师为 Itzhak Tamo。2020年9月加入山东大学。获国际组合数学及应用协会（Institute of Combinatorics）2020年度 Kirkman 奖（该奖项自1994年起颁发，授予博士毕业未满四年的杰出青年学者，每年不超过两位获奖人，本人是2020年唯一获奖人）。入选2021年度国家高层次青年人才项目。

• 主要从事组合数学与信息科学的交叉领域，聚焦极值组合、极值图论、组合设计的基础理论，及其在编码理论、理论计算机科学中的应用，在相关领域国际知名期刊和会议发表或已接收论文30余篇，其中25篇为：国内数学权威期刊 Sci. China Math.、Peking Math. J，组合数学顶刊J. Combin. Theory Ser. A、J. Combin. Theory Ser. B，理论计算机科学顶会和顶刊STOC、FOCS、SIAM J. Comput.，信息论与编码理论顶刊 IEEE Trans. Inform. Theory，离散数学权威期刊 SIAM J. Discrete Math.。

• 研究兴趣：极值组合、极值图论、组合数学中的代数与概率方法、编码理论

• Research interests：Extremal Combinatorics, Extremal Graph Theory, Algebraic and Probabilistic Methods in Combinatorics, Coding Theory

• Openings: I am looking for curious and self-motivated postdocs, PhD and Master students to join my group. If you are interested, please send me an email with your CV.

• 谷歌学术（Google Scholar）组合数学与信息交叉科学研究团队

• News：招收博士后、博士研究生、硕士研究生，欢迎邮件咨询。

• 硕士研究生和博士研究生：免试研究生可以提前进入课题组，开展本科毕业设计。硕士期间表现优异的学生，可申请硕博连读。以申请-考核制报考博士的学生，请参考山大研究院相关通知（https://www.yz.sdu.edu.cn/info/1016/3891.htm）。基本待遇参照山东大学统一规定，本课题组会在学校政策允许范围内给予优厚补助。（有意者请提前联系）

• 博士后：入选山东大学特别资助类博士后，年薪不低于40万元（需学校PK）；入选山东大学重点资助类博士后，年薪不低于30万元（需学院PK）；入选山东大学项目资助类博士后，年薪不低于20万元（导师同意即可）；本课题组会在学校政策允许范围内给予优厚补助。博士后在站期间获得国家级项目资助，可以申请留校任教；博士后出站留青工作，青岛市给予25万元补助。

• 国际交流：课题组与多所国际高水平学术机构保持密切学术交流，依托国家留学基金委、山东大学、课题组经费，鼓励并定期推荐学生出国进行短期交流或者联合培养。

Preprints:

1. Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu, Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon, arXiv:2403.17910

2. Chong Shangguan, Yulin Yang, Tao Zhang, Incidence theorems for multivariate polynomials over finite fields, arXiv:2509.17563

3. Zeyu Guo, Roshan Raj, Chong Shangguan, Zihan Zhang, Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets, arXiv:2604.13431

4. Chong Shangguan, Yulin Yang, Improved Rate-versus-Distance Upper Bounds for LDPC Codes, arXiv:2605.01213

5. Miao Liu, Chong Shangguan, Chenyang Zhang, Sharp bounds for uniform union-free hypergraphs, arXiv:2605.11949

6. Chong Shangguan, Zixiang Xu, Yulin Yang, Balanced Sperner families via the topological Tverberg theorem, arXiv:2606.10885

7. Baoyan Feng, Chong Shangguan, Yulin Yang, Chenyang Zhang, An Erdős Matching Conjecture for Vector Spaces, arXiv:2606.24529

Journal papers:

1. Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge, New bounds and constructions for multiply constant weight codes, IEEE Trans. Inform. Theory 62 (11), 6315-6327, 2016.

2. Chong Shangguan, Gennian Ge, Separating hash families: A Johnson-type bound and new constructions, SIAM J. Discrete Math. 30 (4), 2243-2264, 2016.

3. Chong Shangguan, Gennian Ge, New bounds on the number of tests for disjunct matrices, IEEE Trans. Inform. Theory 62 (12), 7518-7521, 2016.

4. Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao, New bounds for frameproof codes, IEEE Trans. Inform. Theory 63 (11), 7247-7252, 2017.

5. Chong Shangguan, Jingxue Ma, Gennian Ge, New upper bounds for parent-identifying codes and traceability codes, Des. Codes Cryptogr. 86 (8), 1727-1737, 2018.

6. Chong Shangguan, Yiwei Zhang, Gennian Ge, Centralized coded caching schemes: A hypergraphtheoretical approach, IEEE Trans. Inform. Theory 64 (8), 5755-5766, 2018.

7. Gennian Ge, Chong Shangguan, Xin Wang, Some intriguing upper bounds for separating hash families, Sci. China Math., 62 (2), 269-282, 2019.

8. Chong Shangguan, Gennian Ge, A new piggybacking design for systematic MDS storage codes, Des. Codes Cryptogr. 87, 2753-2770, 2019.

9. Chong Shangguan, Itzhak Tamo, Degenerate Turán densities of sparse hypergraphs, J. Combin. Theory Ser. A, 105228, 25pp, 2020.

10. Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, J. Combin. Theory Ser. B (144), 119-149, 2020. 

11. Chong Shangguan, Itzhak Tamo, Sparse hypergraphs with applications to coding theory, SIAM J. Discrete Math., 34 (3), 1493-1504, 2020.

12. Gennian Ge, Chong Shangguan, Maximum subsets of F^n_q containing no right angles, J. Algebraic Combin. (52), 455-460, 2020. 

13. Chong Shangguan, Itzhak Tamo, New Tur\'an exponents for two extremal hypergraph problems, SIAM J. Discrete Math., 34 (4), 2338-2345, 2020.

14. Gennian Ge, Chong Shangguan, Sparse hypergraphs: new bounds and constructions, J. Combin. Theory Ser. B, (147) 96-132, 2021.

15. Eitan Goldberg, C. Shangguan, Itzhak Tamo, List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for every rate, IEEE Trans. Inform. Theory, 69 (4), 2261-2268, 2023.

16. Chong Shangguan, Gennian Ge, Sparse hypergraphs: from theory to applications, SCIENTIA SINICA Mathematica 53 (2), 187-216, 2023.

17. Chong Shangguan, Itzhak Tamo, Generalized singleton bound and list-decoding Reed-Solomon codes beyond the Johnson radius, SIAM J. Comput. 52 (3), 684-717, 2023.

18. Chong Shangguan, Degenerate Tur\'an densities of sparse hypergraphs II: a solution to Brown-Erd\H{o}s-S\'os problem for every uniformity, SIAM J. Discrete Math. 37 (3), 1920-1929, 2023.

19. Chenyang Zhang, Chong Shangguan, Gennian Ge, Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes, IEEE Trans. Inform. Theory 69, no. 11, 7099-7109, 2023.

20. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, SIAM J. Comput. 53 (2024), no. 2, 389-430.

21. Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, J. Combin. Theory Ser. A 203 (2024), Paper No. 105835, 26 pp.

22. Miao Liu, Chong Shangguan, Approximate generalized Steiner systems and near-optimal constant weight codes, J. Combin. Theory Ser. A  209 (2025), Paper No. 105955, 19 pp.

23. Miao Liu, Zengjiao Ma, Chong Shangguan, Near optimal probabilistic constructions of frameproof codes, IEEE Trans. Inform. Theory 71 (2025), no. 6, 4137-4144.

24. Yuanting Shen, Chong Shangguan, Minghui Ouyang, Kuan Cheng, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time? IEEE Trans. Inform. Theory 71 (2025), no. 10, 7626-7643.

25. Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge, Constrained coding bounds via Goulden-Jackson cluster theorem, IEEE Trans. Inform. Theory 71 (2025), no. 12, 9359–9374.

26. Jaehoon Kim, Hong Liu, Chong Shangguan, Guanghui Wang, Zhuo Wu, Yisai Xue, Stability with minuscule structure for chromatic thresholds, Peking Math. J., to appear.

27. Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao, Focal-free uniform hypergraphs and codes, J. Combin. Theory Ser. A  223 (2026), Paper No. 106193.

Conference papers:

1. Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, ISIT2019

2. Chong Shangguan, Itzhak Tamo, Universally Sparse Hypergraphs with Applications to Coding Theory, ISIT 2019

3. Chong Shangguan, Itzhak Tamo, Error detection and error correction in communication graphs, ISIT 2020

4. Chong Shangguan, Itzhak Tamo, Combinatorial list decoding of Reed-Solomon codes beyond the Johnson radius, STOC 2020

5. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, FOCS 2021

6. Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, ISIT 2022

7. Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu. Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon, SoCG 2024

8. Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time?, RANDOM 2024

9. Miao Liu, Chong Shangguan, Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound, ISIT 2024

10. Miao Liu, Zengjiao Ma, Chong Shangguan, Near Optimal Constructions of Frameproof Codes, ISIT 2024