On the Minimum Size of Linear Sets

Recently, a lower bound on the size of linear sets in projective spaces intersecting a hyperplane in a canonical subgeometry was established. There are several constructions showing that this bound is tight. In this paper, we generalize this bound to linear sets meeting some subspace $\pi$ in a canonical subgeometry. We obtain a tight lower bound on the size of any ${\mathbb F}_{q}$-linear set spanning $\mathrm{PG}(d,q^n)$ in case that $n \leq q$ and $n$ is prime. We also give constructions of linear sets attaining equality in the former bound, both in the case that $\pi$ is a hyperplane, and in the case that $\pi$ is a lower dimensional subspace.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-11-28
DOI
https://doi.org/10.37236/12424
Citations
2
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.42

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Minimum Size of Linear Sets

Sam Adriaensen, Paolo Santonastaso
2 citations
The Electronic Journal of Combinatorics
graph theory and CDMA systems
0.42
article

On the Minimum Size of Linear Sets

Sam Adriaensen, Paolo Santonastaso
article en
2 citations

Abstract

Recently, a lower bound on the size of linear sets in projective spaces intersecting a hyperplane in a canonical subgeometry was established. There are several constructions showing that this bound is tight. In this paper, we generalize this bound to linear sets meeting some subspace $\pi$ in a canonical subgeometry. We obtain a tight lower bound on the size of any ${\mathbb F}_{q}$-linear set spanning $\mathrm{PG}(d,q^n)$ in case that $n \leq q$ and $n$ is prime. We also give constructions of linear sets attaining equality in the former bound, both in the case that $\pi$ is a hyperplane, and in the case that $\pi$ is a lower dimensional subspace.

The Electronic Journal of CombinatoricsVol. 31(4)
University of Campania "Luigi Vanvitelli" (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", Vrije Universiteit Brussel, Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni
Openalex Percentile: Top 36%
graph theory and CDMA systems
0.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.