Automorphism groups of maximum scattered linear sets in finite projective lines (Q6946529)

Maximum scattered linear sets of the projective line over a finite field give rise to special type of rank-metric codes (linear maximum rank distance codes MRD with high value for the minimum distance) which have become a standard tool in the transmission of information theory based upon random networks. It is also known that if relevant linear MRD codes are equivalent, then the ensuing linear sets are equivalent as well. Therefore, knowledge of the full automorphism group of a maximum linear set of the projective line may play a central role in understanding whether or not a new construction of codes with above mentioned parameters effectively contains, up to equivalence, new examples.\N\NThe aim of this article is to determine, for any given maximum scattered linear set \(L_{U}\) of \(\mathrm{PG}(1,q^{n})\) defined by an \(\mathbb{F}_{q}\)-subspace \(U\), all possibilities for the structure of its automorphism group. In particular, the authors prove that if the code associated with \(U\) has a non-trivial right idealizer which is not too small, then \(\mathrm{Aut}(L_{U} ) \cap \mathrm{PGL}(2, q^{n})\) must be cyclic or dihedral.\N\NThe authors have concluded the article with the following problems for further study:\N\NProblem 5.1. For \(n >2\), prove or disprove the existence of maximum scattered linear sets \(L_{f}\) in \(\mathrm{PG}(1,q^{n})\) with \(\mathrm{Aut}_{\mathrm{PGL}}(L_{f})\) not isomorphic to a cyclic or a dihedral group.\N\NProblem 5.2. For a scattered polynomial \(f\) in standard form over \(\mathbb{F}_{q^{n}}\), find new effective approaches to determine every diagonal matrix and every anti-diagonal matrix in \(\mathrm{Aut}_{\mathrm{PGL}}(L_{f})\).