{"paper":{"title":"Maximum scattered linear sets and MRD-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bence Csajb\\'ok, Ferdinando Zullo, Giuseppe Marino, Olga Polverino","submitted_at":"2017-01-24T12:13:16Z","abstract_excerpt":"The rank of a scattered $\\mathbb{F}_q$-linear set of $\\mathrm{PG}(r-1,q^n)$, $rn$ even, is at most $rn/2$ as it was proved by Blokhuis and Lavrauw. Existence results and explicit constructions were given for infinitely many values of $r$, $n$, $q$ ($rn$ even) for scattered $\\mathbb{F}_q$-linear sets of rank $rn/2$. In this paper we prove that the bound $rn/2$ is sharp also in the remaining open cases.\n  Recently Sheekey proved that scattered $\\mathbb{F}_q$-linear sets of $\\mathrm{PG}(1,q^n)$ of maximum rank $n$ yield $\\mathbb{F}_q$-linear MRD-codes with dimension $2n$ and minimum distance $n-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06831","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}