報(bào)告題目：Maximum scattered linear sets and their equivalence problem

報(bào)告時(shí)間：2023年9月22日下午15:00-16:00

報(bào)告地點(diǎn)：kaiyun開(kāi)云官方網(wǎng)站犀浦校區(qū)7教X7510

報(bào)告人：周悅

摘要：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, rank-metric codes and etc. A linear set with the largest possible cardinality is called 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 found by Lunardon and Polverino in 2001 and later generalized by Sheekey in 2016. The third family was constructed by Longobardi, Marino, Trombetti and the speaker recently.

In this talk, we consider the equivalence problem of maximum scattered linear sets and we show some restrictions on their automorphism groups.

報(bào)告人簡(jiǎn)介：周悅，國(guó)防科技大學(xué)數(shù)學(xué)系，研究員。主要研究有限幾何、代數(shù)組合及其在編碼密碼中的應(yīng)用，在Adv. Math., J. Cryptology, JCTA, IEEE TIT等期刊發(fā)表論文50余篇。2016年獲得國(guó)際組合及其應(yīng)用學(xué)會(huì)Kirkman獎(jiǎng)?wù)拢聡?guó)“洪堡”Fellow。2019年起擔(dān)任國(guó)際期刊Designs, Codes and Cryptography編委。2021年獲評(píng)國(guó)家級(jí)青年人才。

窗體底端