On the number of roots of some linearized polynomials

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have been already proved in [7,10,24]. In this paper we provide bounds and characterizations on the number of roots of linearized polynomials of this form ax+b0xqjavax.xml.bind.JAXBElement@7412a953+b1xqjavax.xml.bind.JAXBElement@752ac3ad+b2xqjavax.xml.bind.JAXBElement@4a94cef3+…+bt−1xqjavax.xml.bind.JAXBElement@6f9ed9c5∈Fqjavax.xml.bind.JAXBElement@25eb4dc3[x], with gcd⁡(s,n)=1. Also, we characterize the number of roots of such polynomials directly from their coefficients, dealing with matrices which are much smaller than the relative Dickson matrices and the companion matrices used in the previous papers. Furthermore, we develop a method to find explicitly the roots of a such polynomial by finding the roots of a qn-polynomial. Finally, as an application of the above results, we present a family of linear sets of the projective line whose points have a small spectrum of possible weights, containing most of the known families of scattered linear sets. In particular, we carefully study the linear sets in PG(1,q6) presented in [9].