SearcharxivSearch

arXiv · 2411.11855

Scattered polynomials: an overview on their properties, connections and applications

Abstract

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A. Blokhuis, M. Lavrauw. Scattered spaces with respect to a spread in $\mathrm{PG}(n, q)$. Geometriae Dedicata 81(1) (2000), 231-243] and [G. Lunardon, O. Polverino. Blocking sets and derivable partial spreads. J. Algebraic Combin. 14 (2001), 49-56]. Recently, their connection to maximum rank-metric codes was brought to light in [J. Sheekey. MRD codes: Constructions and connections. In K.-U. Schmidt and A. Winterhof, editors, Combinatorics and Finite Fields, De Gruyter (2019), 255-286]. This link has significantly advanced their study and investigation, sparking considerable interest in recent years. Here, we will explore their relationship with certain subsets of the finite projective line $\mathrm{PG}(1, q^n)$ known as maximum scattered linear sets, as well as with codes made up of square matrices of order $n$ equipped with the rank metric. We will review the known examples of scattered polynomials up to date and discuss some of their key properties. We will also address the classification of maximum scattered linear sets of the finite projective line $\mathrm{PG}(1, q^n)$ for small values of $n$ and discuss characterization results for the examples known so far. Finally, we will retrace how each scattered polynomial gives rise to a translation plane, as discussed in [V. Casarino, G. Longobardi, C. Zanella. Scattered linear sets in a finite projective line and translation planes, Linear Algebra Appl. 650 (2022), 286-298] and in [G. Longobardi, C. Zanella, A standard form for scattered linearized polynomials and properties of the related translation planes, J. Algebr. Comb. 59(4) (2024), 917-937].

Explore related subjects

Keep this discovery

BibTeXRIS

Giovanni Longobardi. 2024-11-01. Scattered polynomials: an overview on their properties, connections and applications. https://arxiv.org/abs/2411.11855

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO