2021年3月，國際組合數學及其應用協會(hui) （Institute of Combinatorics and its Applications，以下簡稱 ICA）公布了該協會(hui) 2020年度的各獎項（詳情見鏈接）。中國科學技術大學馬傑教授榮獲2020年度Hall獎，山東(dong) 大學上官衝(chong) 教授榮獲2020年度Kirkman獎。

ICA協會(hui) 成立於(yu) 1990年。該組織每年頒發Euler獎、Hall獎和Kirkman獎三種獎項，其中Euler獎是終身成就獎，Hall獎和Kirkman獎分別授予博士畢業(ye) 未達到十九年和四年的傑出青年學者。2016年起又設立了Stanton獎，是麵向ICA成員的終身教育成就獎。

馬傑教授就職於(yu) 中國科學技術大學數學科學學院，主要從(cong) 事組合圖論領域的研究工作及其在理論計算機和信息科學中的應用。曾入選海外高層次人才引進計劃青年項目、基金委優(you) 秀青年科學基金項目，獲中國工業(ye) 與(yu) 應用數學學會(hui) 應用數學青年科技獎、教育部霍英東(dong) 基金高等院校青年教師獎，現擔任美國工業(ye) 與(yu) 應用數學學會(hui) 雜誌《SIAM Journal on Discrete Mathematics》編委。因其在極值概率圖論和結構圖論所取得的傑出成果，馬傑教授獲得了2020年度Hall獎。

上官衝(chong) 教授就職於(yu) 山東(dong) 大學數學與(yu) 交叉科學研究中心，主要研究興(xing) 趣包括極值組合、概率組合、組合數學中的多項式方法與(yu) 線性代數方法以及編碼理論。因其在極值組合和編碼密碼所取得的突出成果，上官衝(chong) 教授獲得了2020年度Kirkman獎。

以下是ICA協會(hui) 給兩(liang) 位教授的頒獎詞： 

2020 Hall Medal awarded to Jie Ma

Jie Ma has made outstanding contributions in the fields of extremal and probabilistic combinatorics, and structural graph theory. He obtained several important results in the study of hypergraph Turan numbers, and proved several conjectures on the distribution of cycle lengths in graphs. He solved, or asymptotically solved, several open problems by Bollobas and Scott on judicial partitions of graphs and hypergraphs, which is a “very strong, impressive record”. Using “sophisticated arguments and novel tools”, he has made breakthroughs on several other difficult, longstanding problems of structural and extremal flavour.

Dr. Ma has published over thirty papers in the most prestigious combinatorial journals. He is a frequent speaker at national and international conferences, and a member of recognized editorial boards.

2020 Kirkman Medal award to Chong Shangguan

Chong Shangguan has made deep contributions to extremal combinatorics and combinatorial coding theory. His notable research achievements include an original and elegant proof regarding the combinatorial list-decodability of Reed-Solomon codes, significant progress on two well-known and difficult conjectures on the Turan number of sparse hypergraphs, and the resolution of several conjectures and open problems on perfect hash and separating hash families.

Dr. Shangguan’s research has resulted in 16 published papers, most of which appeared in the very best journals or conference proceedings in the fields of combinatorics, coding theory, and theoretical computer science. A striking feature of his research is the broad range from theory to applications, where tools from extremal combinatorics, additive combinatorics, probabilistic combinatorics, and the polynomial method are involved.

米兰体育官方网站入口組合數學與(yu) 圖論專(zhuan) 業(ye) 委員會(hui)