报告学者：Nika Salia

报告者单位：King Fahd University of Petroleum & Minerals

报告时间：2025年6月9日（周一）16:30--17:30

报告地点：学活十层会议室

报告摘要：This talk presents an analog of the classical Erdős–Ko–Rado theorem in the context of monic polynomials over finite fields, resolving a conjecture of Tompkins. We identify the largest possible families of degree-n monic polynomials over a finite field where any two polynomials share a common factor of degree at least ℓ. We establish tight bounds for such families, characterize the extremal examples, and extend the study to triple-intersecting families and polynomials of degree at most n.

Joint work with Dávid Tóth

简介：Dr. Nika Salia is an Assistant Professor of Mathematics at King Fahd University of Petroleum & Minerals (KFUPM). His research focuses on extremal and probabilistic combinatorics. Dr. Salia earned his Ph.D. from Central European University under the supervision of Ervin Győri and has held research positions at the Alfréd Rényi Institute of Mathematics and the Institute for Basic Science. He has published in leading combinatorics journals