Affiliation:
1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Abstract
Consider the n-dimensional projective space PG(n,q) over a finite field with q elements. A spread in PG(n,q) is a set of lines which partition the point set. A parallelism is a partition of the set of lines by spreads. A deficiency one parallelism is a partial parallelism with one spread less than the parallelism. A transitive deficiency one parallelism corresponds to a parallelism possessing an automorphism group which fixes one spread and is transitive on the remaining spreads. Such parallelisms have been considered in many papers. As a result, an infinite family of transitive deficiency one parallelisms of PG(n,q) has been constructed for odd q, and it has been proved that the deficiency spread of a transitive deficiency one parallelism must be regular, and its automorphism group should contain an elation subgroup of order q2. In the present paper we construct parallelisms of PG(3,7) invariant under an elation group of order 49 with some additional properties, and thus we succeed to obtain all (46) transitive deficiency one parallelisms of PG(3,7). The three parallelisms from the known infinite family are among them. As a by-product, we also construct a much bigger number (55,022) of parallelisms which have the same spread structure, but are not transitive deficiency one.
Funder
Bulgarian National Science Fund
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference40 articles.
1. Galois geometries and Coding Theory;Etzion;Des. Code Cryptogr.,2016
2. Stinson, D.R. (2004). Combinatorial Designs: Constructions and Analysis, Springer.
3. Coding for errors and erasures in random network coding;Koetter;IEEE T Inform. Theory,2008
4. New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes;Gruner;IEEE T Commun.,2012
5. Chung, F., Graham, R., Hoffman, F., Mullin, R.C., Hogben, L., and West, D.B. (2019). 50 Years of Combinatorics, Graph Theory, and Computing, Hall/CRC Press.