The smallest spectral radius of bicyclic uniform hypergraphs with given size

 报告题目：The smallest spectral radius of bicyclic uniform hypergraphs with given size

 报告时间：2020-12-16 15:00-16:00

 报告地点：Zoom会议室：95163220669 密码：123321 

 个人简介: 单海英, 同济大学数学科学学院教授，博士生导师。1998年9月-2004年3月在同济大学应用数学系所攻读硕士及博士学位, 师从于邵嘉裕教授, 随后留校工作。主要从事在组合矩阵论方面的研究，发表论文40余篇。主持国家自然科学基金、国家自然科学青年基金等多项科研课题。

 报告摘要：Hypergraphs, which are also known as set systems and block  designs, are fundamental to the study of complex discrete systems. Identifying graphs with extremal properties is an extensively studied topic in spectral graph theory. In this talk, we study the log-concavity of a type of iteration sequence related to the $\alpha$-normal weighted incidence matrices for computing the spectral radius of hypergraphs. By using results obtained about the sequence and the method of some edge operations, we will characterize completely extremal $k$-graphs with the smallest spectral radius among bicyclic hypergraphs with given size.