勷勤数学•专家报告-祁力群

勷勤数学•专家报告


题      目:A Weak Condition for Limited Augmented Zarankiewicz Numbers


报  告  人: 祁力群 教授  (邀请人:陈艳男)

                                                香港理工大学


时      间: 8月18日  16:00-17:00

          

地     点:数科院西楼二楼会议室


报告人简介:

          祁力群教授1968年在清华大学计算数学专业毕业,1981年和1984年在美国威斯康星大学麦迪逊分校计算机科学分别取得硕士学位和博士学位。祁力群教授曾任教于清华大学,澳大利亚新南威尔士大学,香港城市大学和香港理工大学,现为香港理工大学应用数学荣休教授。祁力群教授在国际杂志上发表了380多篇论文。他建立了半光滑牛顿方法的超线性收敛理论,和光滑化牛顿方法的全局收敛理论,于2010年取得中国运筹学会科学技术一等奖。祁力群教授的论文在世界上被广泛应用,在2003-2010年度被列为世界高被引数学家,在2018,2019,2020,2021和2022年被再次列为世界高被引数学家。祁力群在十个国际杂志担任主编或编委。祁力群教授在 2005年提出高阶张量特征值,并继而形成高阶张量谱理论,在医疗工程,数据分析,量子物理,超图谱理论,液晶研究等方面取得应用,並于2017年和2018年分別在美国工业应用数学协会和斯普林格出版社出版张量理论的专著。



摘      要:

           We introduce the weak augmented Zarankiewicz number $z_{wA}(m,n)$ and the weak limited augmented Zarankiewicz number $z_{wL}(m,n)$, which are combinatorial extensions of the classical Zarankiewicz number obtained by relaxing the original admissibility conditions for augmented bipartite graphs. We show that the resulting weak framework still guarantees irreducibility of the associated doubly simple biquadratic forms, with SOS rank equal to the total number of edges. This yields the inequality chain

\[\mathrm{BSR}(m,n) \geq z_{wA}(m,n) \geq z_{wL}(m,n) \geq z_L(m,n) \geq z(m,n).\]

We provide three complementary constructions demonstrating the power of the weak framework. First, a $5\times 3$ construction using degenerate 2-edges yields $z_{wL}(5,3)\ge 10>9=z_L(5,3)$, giving $\BSR(5,3)\ge 10$. Second, a $15\times 6$ construction on the incidence graph of $K_6$ with 14 nondegenerate 2-edges gives $z_{wL}(15,6)\ge 44>43$, improving the previously known bound. Third, a critical $6\times 3$ construction with complementary 2-cycles gives $z_{wL}(6,3)\ge 12>11=z_L(6,3)$, yielding $\BSR(6,3)\ge 12$ and demonstrating that complementary 2-cycles are safe.

We further study the exact values of $z_{wL}(m, 3)$ for $m = 5, 6, \cdots, 13$.  and discover that $z_{wL}(m, 3) = 2m$ for $m = 5, 6, \cdots, 9$ and follows a staircase pattern for $m = 10, 11, 12, 13$.

This work is done jointly with Chungfeng Cui, Yi Xu and Yannan Chen.



       


          欢迎老师、同学们参加、交流!