On the equivalence of Lunardon-Polverino maximum scattered linear sets
数学专题报告
报告题目(Title)：On the equivalence of Lunardon-Polverino maximum scattered linear sets
报告人(Speaker)：周悦 研究员 （国防科技大学）
地点(Place)：腾讯会议 ID：176361275
时间(Time)：2022 年 4 月 20 日（周三） 15:00--16:00
邀请人(Inviter)：吕本建、王恺顺
报告摘要
The concept of linear sets in projective spaces was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rankmetric codes and etc. A linear set with the largest possible cardinality and maximum rank is called maximum scattered. Despite of two decades of study, there are only three known families of maximum scattered linear sets defined over PG(1,q^n) for infinitely many n. The first family is called pseudo-regulus type by Blokhuis and Lavrauw in 1999. The second family was constructed by Lunardon and Polverino in 2001. It is a bit surprising that the equivalence problem for two different members in the Lunardon-Polverino family is still not completely solved.
In this talk, we will provide an answer to this question and the determination of the automorphism group of each member in the Lunardon-Polverino family. This talk is based on a recent joint work with W. Tang and F. Zullo.
主讲人简介
周悦，国防科技大学数学系研究员，教育部青年长江学者。主要研究有限几何、代数组合及其在编码密码中的应用，在Adv. Math., J. Cryptology, JCTA等期刊发表论文40余篇。2016年获得国际组合及其应用学会Kirkman奖章。2019年起担任国际期刊Designs, Codes and Cryptography编委。。
