June 4, 2024Open Access

Classifying Sets of Type (4,n) in PG(3,q)

Key Points

Key points are not available for this paper at this time.

Abstract

In the present work, we classify sets of type (4,n) in PG(3,q). We prove that PG(3,q), apart from the planes of PG(3,3), contains only sets of type (4,n) with standard parameters. Thus, somewhat surprisingly, we conclude that there are no sets of type (4,n) in PG(3,q), q ≠ 3, with non-standard parameters.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

Stefano Innamorati (Tue,) studied this question.

synapsesocial.com/papers/68e664a3b6db6435875f0b4e https://doi.org/https://doi.org/10.3390/foundations4020017

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On sets of type $${\varvec{(m,m+q)_2}}$$ ( m , m + q ) 2 in $${\varvec{PG(3,q)}}$$ P G ( 3 , q )2017 · 8 citations
2Maximal partial spreads in PG(3,5)2000 · 6 citations
3On k-sets of type (2, h) in a planar space.2006 · 5 citations
4Weights of linear codes and strongly regular normed spaces1972 · 178 citations
5A combinatorial problem1973 · 51 citations

Bookmark

View Full Paper