Partial k-Parallelisms in Finite Projective Spaces

2013/02/14 by Tuvi Etzion, Etzion, Tuvi
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1302.3629

openalex publication_date 2013/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we consider the following question. What is the maximum number of pairwise disjoint k-spreads which exist in PG(n,q)? We prove that if k+1 divides n+1 and n>k then there exist at least two disjoint k-spreads in PG(n,q) and there exist at least 2^k+1-1 pairwise disjoint k-spreads in PG(n,2). We also extend the known results on parallelism in a projective geometry from which the points of a given subspace were removed.

Related

• New lower bounds for partial k-parallelisms
• On line-parallelisms of PG(3, q)
• The maximum size of a partial spread in a finite projective space
• Upper bounds for the number of substructures in finite geometries from the container method
• A new class of maximal partial spreads in PG(4,q)