个人简介
上官冲，山东大学数学与交叉科学研究中心教授、博导，山东大学杰出中青年学者。分别于2012年6月、2017年6月获得浙江大学数学学院理学学士、博士学位，博士导师为葛根年教授。毕业后于2017年8月至2020年7月在以色列特拉维夫大学从事博士后研究工作，合作导师为 Itzhak Tamo。2020年9月加入山东大学。获国际组合数学及应用协会（Institute of Combinatorics）2020年度 Kirkman 奖（该奖项自1994年起颁发，授予博士毕业未满四年的杰出青年学者，每年不超过两位获奖人，本人是2020年唯一获奖人）。入选2021年度国家高层次青年人才项目。
主要从事组合数学与信息科学交叉领域的研究，在极值组合学、理论计算机科学、编码理论、图论及其应用等领域的多个重要问题上做出一系列贡献，已在组合数学顶刊《Journal of Combinatorial Theory, Series A》与《Journal of Combinatorial Theory, Series B》、理论计算机科学顶会与顶刊《Annual ACM SIGACT Symposium on Theory of Computing (STOC)》、《Annual IEEE Symposium on Foundations of Computer Science (FOCS)》、《SIAM Journal on Computing》、信息论与编码理论顶刊《IEEE Transactions on Information Theory》、离散数学权威期刊《SIAM Journal on Discrete Mathematics》等相关领域的国际知名刊物上发表论文二十余篇。
研究兴趣：极值组合、组合数学中得代数与概率方法、编码理论
Research interests：Extremal Combinatorics, 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.
Preprints:
Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time?, arXiv:2312.16087
Miao Liu, Zengjiao Ma, Chong Shangguan, Near optimal constructions of frameproof codes, arXiv:2402.07711
Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu. Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon, arXiv:2403.17910
Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge, Constrained coding upper bounds via Goulden-Jackson cluster theorem, arXiv:2407.16449
Xinqi Huang, Chong Shangguan, Xiande Zhang, Yuhao Zhao, Focal-free uniform hypergraphs and codes, arXiv:2410.23611
Miao Liu, Chong Shangguan, Chenyang Zhang, Asymptotically sharp bounds for cancellative and union-free hypergraphs, arXiv:2411.07908
Journal papers:
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.
Chong Shangguan, Gennian Ge, Separating hash families: A Johnson-type bound and new construc-tions, SIAM J. Discrete Math. 30 (4), 2243-2264, 2016.
Chong Shangguan, Gennian Ge, New bounds on the number of tests for disjunct matrices, IEEE Trans. Inform. Theory 62 (12), 7518-7521, 2016.
Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao, New bounds for frameproof codes, IEEE Trans. Inform. Theory 63 (11), 7247-7252, 2017.
Chong Shangguan, Jingxue Ma, Gennian Ge, New upper bounds for parent-identifying codes and traceability codes, Des. Codes Cryptogr. 86 (8), 1727-1737, 2018.
Chong Shangguan, Yiwei Zhang, Gennian Ge, Centralized coded caching schemes: A hypergraphtheoretical approach, IEEE Trans. Inform. Theory 64 (8), 5755-5766, 2018.
Gennian Ge, Chong Shangguan, Xin Wang, Some intriguing upper bounds for separating hash families, Sci. China Math., 62 (2), 269-282, 2019.
Chong Shangguan, Gennian Ge, A new piggybacking design for systematic MDS storage codes, Des. Codes Cryptogr. 87, 2753-2770, 2019.
Chong Shangguan, Itzhak Tamo, Degenerate Turán densities of sparse hypergraphs, J. Combin. Theory Ser. A, 105228, 25pp, 2020.
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, J. Combin. Theory Ser. B (144), 119-149, 2020.
Chong Shangguan, Itzhak Tamo, Sparse hypergraphs with applications to coding theory, SIAM J. Discrete Math., 34 (3), 1493-1504, 2020.
Gennian Ge, Chong Shangguan, Maximum subsets of F^n_q containing no right angles, J. Algebraic Combin. (52), 455-460, 2020.
Chong Shangguan, Itzhak Tamo, New Tur\'an exponents for two extremal hypergraph problems, SIAM J. Discrete Math., 34 (4), 2338-2345, 2020.
Gennian Ge, Chong Shangguan, Sparse hypergraphs: new bounds and constructions, J. Combin. Theory Ser. B, (147) 96-132, 2021.
Eitan Goldberg, Chong Shangguan, Itzhak Tamo, List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate, IEEE Trans. Inform. Theory, 69 (4), 2261–2268, 2023.
Chong Shangguan, Gennian Ge, Sparse hypergraphs: from theory to applications, SCIENTIA SINICA Mathematica 53 (2), 187-216, 2023.
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.
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.
Chenyang Zhang, Chong Shangguan, Gennian Ge, Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes, IEEE Trans. Inform. Theory 69 (2023), no. 11, 7099–7109.
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.
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.
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.
Conference papers:
Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, ISIT2019
Chong Shangguan, Itzhak Tamo, Universally Sparse Hypergraphs with Applications to Coding Theory, ISIT 2019
Chong Shangguan, Itzhak Tamo, Error detection and error correction in communication graphs, ISIT 2020
Chong Shangguan, Itzhak Tamo, Combinatorial list decoding of Reed-Solomon codes beyond the Johnson radius, STOC 2020
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Improved list-decoding of Reed-Solomon codes via tree packings, FOCS 2021
Eitan Goldberg, Chong Shangguan, Itzhak Tamo, Singleton-type bounds for list-decoding and list-recovery, and related results, ISIT 2022
Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu. Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon, SoCG 2024
Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen, When can an expander code correct $\Omega(n)$ errors in $O(n)$ time?, RANDOM 2024
Miao Liu, Chong Shangguan, Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound, ISIT 2024
Miao Liu, Zengjiao Ma, Chong Shangguan, Near Optimal Constructions of Frameproof Codes, ISIT 2024