Saturating linear sets in PG$(2,q^4)$
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917595648622592 |
|---|---|
| author | Zullo, Ferdinando |
| author_facet | Zullo, Ferdinando |
| contents | Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study \emph{$1$-saturating} linear sets in PG$(2,q^4)$, that is $\mathbb{F}_q$-linear sets in PG$(2,q^4)$ with the property that their secant lines cover the entire plane. By making use of a characterization of generalized Gabidulin codes, we prove that the rank of such a linear set is at least $5$. This answers to a recent question posed by Bartoli, Borello and Marino. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_14387 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Saturating linear sets in PG$(2,q^4)$ Zullo, Ferdinando Combinatorics Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study \emph{$1$-saturating} linear sets in PG$(2,q^4)$, that is $\mathbb{F}_q$-linear sets in PG$(2,q^4)$ with the property that their secant lines cover the entire plane. By making use of a characterization of generalized Gabidulin codes, we prove that the rank of such a linear set is at least $5$. This answers to a recent question posed by Bartoli, Borello and Marino. |
| title | Saturating linear sets in PG$(2,q^4)$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.14387 |