Rigidity theorems for partial linear spaces (Q5953383): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4004114 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Codes associated with generalized polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the BIB design having the minimum p-rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3700375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The \(\mathbb{F}_p\) span of the incidence matrix of a finite projective plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture / rank | |||
Normal rank |
Latest revision as of 22:25, 3 June 2024
scientific article; zbMATH DE number 1694177
Language | Label | Description | Also known as |
---|---|---|---|
English | Rigidity theorems for partial linear spaces |
scientific article; zbMATH DE number 1694177 |
Statements
Rigidity theorems for partial linear spaces (English)
0 references
11 March 2002
0 references
Frmo the introduction: Let \(({\mathcal X},{\mathcal L})\) be a partial linear space such that each of its points is contained in at least \(n+1\) lines. Fix a prime \(p\). Let \({\mathcal C}_{\mathcal L}\subseteq \mathbb{F}^{\mathcal X}_p\) denote the \(p\)-ary code generated by lines in \({\mathcal L}\) and \({\mathcal C}^\perp_{\mathcal L}\) denote its dual. In this article, we prove that the minimum weight of \({\mathcal C}^\perp_{\mathcal L}\) is at least \(2n+ 2-{2n\over p}\). (As a special case of our result we see that the minimum weight of the \(p\)-ary code dual to the code generated by lines in a projective plane of order \(n\) is at least \(2n+ 2-{2n\over p}\). This bound sharply improves upon the earlier known bounds as given in [\textit{E. F. Assumus, jun.} and \textit{J. D. Key}, ``Designs and their codes'', Cambridge Univ. Press, Cambridge, UK (1992; Zbl 0762.05001), Corollary 6.3.1 and Theorem 6.4.2].) We also prove that the induced structure on the support of a word of weight \(2n+ 2-{2n\over p}\) in \({\mathcal C}^\perp_{\mathcal L}\), if it exists, is isomorphic to the join of two Steiner 2-designs with \({n\over p}\) lines through every point and \(p\) points on every line (Theorem 2).
0 references
partial linear space
0 references
\(p\)-ary code
0 references
minimum weight of the \(p\)-ary code dual to the code
0 references