Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

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

Дата публикации: 22-05-2026 00:00:00

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 those described by A. Blokhuis, M. Lavrauw in 2000, and by G. Lunardon, O. Polverino in 2001. In 2016, J. Sheekey brought to light their connection to maximum rank-metric codes. 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 PG(1,qn) 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 known 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 PG(1,qn) 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 by V. Casarino, G. Longobardi, C. Zanella in 2022 and by G. Longobardi, C. Zanella in 2024.

Основное содержимое страницы с новостью.

Authors DOI: https://doi.org/10.26493/2590-9770.1842.2f0 Keywords: Finite field, linearized polynomial, scattered polynomial, projective space, linear set, rank-metric code 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 those described by A. Blokhuis, M. Lavrauw in 2000, and by G. Lunardon, O. Polverino in 2001. In 2016, J. Sheekey brought to light their connection to maximum rank-metric codes. 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 PG(1,qn) 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 known 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 PG(1,qn) 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 by V. Casarino, G. Longobardi, C. Zanella in 2022 and by G. Longobardi, C. Zanella in 2024.

Issue Section

Open Problems on Rank Metric Codes

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1Rank-metric codes over arbitrary fields: Bounds and constructions08.410-08-2026
2Scramble number and tree-cut decompositions09.1821-04-2026
3Perfect Hermitian rank-metric codes09.1801-07-2026
4A note on Cayley nut graphs whose degree is divisible by four011.6203-02-2026
5Paint cost spectrum of perfect k-ary trees05.1528-01-2026
6Switching graphs and Hadamard matrices08.5621-05-2026
7Mulatu Polynomials and an Efficient Detection Algorithm for Mulatu Numbers [version 2; peer review: 2 not approved]010.5511-08-2026
8 Limiting Over-Smoothing and Over-Squashing of Graph Message Passing by Deep Scattering Transforms 010.8717-08-2026
9Derivatives and Analytic Properties of Mulatu Polynomials [version 1; peer review: awaiting peer review]07.6707-08-2026
10Exact Localized Information Capacity of a Local Observable in a Hilbert-Space-Shattered System0516-07-2026

Классификация: . Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 9.4. Источник: adam-journal.eu.