报告题目：Information Theoretic Constraints Breed New Combinatorial Structures: Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four
报告时间：2025年10月10日 星期五 10：00
地点：无线谷5号楼5216会议室
主讲人：陈琦 副教授 西安电子科技大学 通信工程学院
Abstract：Characterization of entropy functions is of fundamental importance in information theory. By imposingconstraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the regionand entropy functions on them with special structures. In this talk, we introduce a system of entropy functioncharacterization from the perspective of faces of the polymatroidal region, which covers the traditionalinequality characterization. We enumerated all 59 types of 2-dimensional faces of Γ4 by an algorithm, fullycharacterize entropy functions on 57 types of them, and partially characterize the remaining 2 types. Forsome of the faces, we adopt the graph-coloring approach to characterize the entropy functions on them,and for the others, we introduce some new combinatorial design structures. These structures are generalizationsof variable-strength orthogonal which are utilized to characterize matroidal entropy functions, andthey are interesting themselves for combinatorial theorists.
Biography：Qi Chen received his PhD degree at Information Engineering Department, The Chinese University of HongKong in 2014. From 2014 to 2017, He was a post-doctoral fellow at Institute of Network Coding and InformationEngineering Department, The Chinese University of Hong Kong . From Sept. 2015 to Jan. 2016, hewas also a postdoc at ECE department, Drexel University. In 2018, he joined School of Telecommunication Engineering, Xi’dian University, Xi’an, China, where he is now an associate professor. His research interestsinclude information theory and related areas, in particular, the characterization of the entropy region.
