Parallelisms of PG(n, q)
Keywords:
Projective space, parallelism, classification, automorphismAbstract
Let PG(n, q) be the n-dimensional projective space over the finite field GF(q). A set of lines, such that each point is in exactly one of these lines, is called a spread. A parallelism is a partition of the lines of the projective space to spreads. The present paper considers the main properties of parallelisms of PG(n, q), the motivation for their study, the known results and some open problems in this research area.
References
R. D. Baker. Partitioning the planes of AG2m(2) into 2-designs. Discrete Math. 15, no. 3 (1976), 205–211.
J. Bamberg. There are no regular packings of PG(3, 3) or PG(3, 4). https://symomega. wordpress.com/2012/12/01/. Last accessed 24 Jan 2019
Th. Beth, D. Jungnickel, H. Lenz. Design Theory. Cambridge, Cambridge University Press, 1993.
A. Betten. The packings of PG(3, 3). Des. Codes Cryptogr. 79, no. 3 (2016), 583–595.
A. Betten, S. Topalova, S. Zhelezova. Parallelisms of PG(3, 4) invariant under cyclic groups of order 4. In: 8-th International Conference, CAI 2019 (Eds M. Ciric, M. Droste, Jean-Eric Pin), 88–99. Lecture Notes in Comput. Sci., vol. 11545, Springer, Heidelberg, 2019.
A. Beutelspacher. On parallelisms in finite projective spaces. Geom. Dedicata 3, no. 1 (1974), 35–40.
M.Biliotti, V. Jha, N. Johnson. Classification of transitive deficiency one partial parallelisms. Bull. Belg. Math. Soc. 12 (2005), 371–391.
R. H. Bruck, R. C. Bose. The construction of translation planes from projective spaces. Journal of Algebra, 1 (1), (1964), 85–102.
T. Calinski, S. Kageyama. ´ On the analysis of experiments in affine resolvable designs. J. Statist. Plann. Inference 138, no. 11, (2008), 3350–3356.
R. H. F. Denniston. Some packings of projective spaces. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Nat. (8) 52, (1972), 36–40.
R. H. F. Denniston. Cyclic packings of the projective space of order 8. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Nat. (8) 54 (1973), 373–377.
E. Diaz, N. Johnson, A. Montinaro. Transitive deficiency one partial parallelisms. Adv. Appl. Discrete Math. 1, no. 1 (2008), 1–34.
C. Ding, J. Yin. A construction of optimal constant composition codes. Des. Codes Cryptogr. 40, no. 2 (2006), 157–165.
T. Etzion, N. Silberstein. Codes and designs related to lifted MRD codes. IEEE Trans. Inform. Theory 59, no. 2 (2013), 1004–1017.
T. Etzion, L. Storme. Galois geometries and Coding Theory. Des. Codes Cryptogr. 78, no. 1 (2016), 311–350.
T. Etzion, A. Vardy. Automorphisms of codes in the Grassmann scheme. arXiv:1210.5724 [math.CO] (October 2012).
D. Heinlein, Th. Honold, M. Kiermaier, S. Kurz. Generalized vector space partitions. Australas. J. Combin. 73 (2019), 162–178.
V. Jha, N. L. Johnson. Regular parallelisms from translation planes. Discrete Math. 59, no. 1–2 (1986), 91–97.
N. L. Johnson. Some new classes of finite parallelisms. Note Mat. 20, no. 22 (2000/01), 77–88.
N. L. Johnson. Combinatorics of spreads and parallelisms. Pure and Applied Mathematics (Boca Raton), vol. 295. Boca Raton, FL, CRC Press, 2010.
S. L. Johnson, S. R. Weller. Resolvable 2-designs for regular low density parity-check codes. IEEE Trans. Comm. 51, no. 9 (2003), 1413–1419.
N. L. Johnson, A. Montinaro. The doubly transitive t-parallelisms. Results Math. 52, no. 1–2 (2008) 75–89.
N. L. Johnson, A. Montinaro. The transitive t-parallelisms of a finite projective space. Adv. Geom. 12, no. 3 (2012), 401–429.
N. L. Johnson, R. Pomareda. Transitive partial parallelisms of deficiency one. European J. Combin. 23, no. 8 (2002), 969–986.
T. P. Kirkman. Query VI. Lady’s and Gentlemen’s Diary (1850), 48.
R. Kotter, F. R. Kschischang. ¨ Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory 54, no. 8 (2008), 3579–3591.
K. Kurosawa, S. Kageyama. New bound for affine resolvable designs and its application to authentication codes. In: Computing and Combinatorics (Xi’an, 1995) (Eds Du DZ., Li M), 292–302. Lecture Notes in Comput. Sci., vol. 959. Berlin, Springer, 1995.
G. Lunardon. On regular parallelisms in PG(3, q). Discrete Math. 51, no. 3 (1984), 229–335.
O. Olmez, A. Ramamoorthy. Fractional repetition codes with flexible repair from combinatorial designs. IEEE Trans. Inform. Theory 62, no. 4 (2016), 1565–1591.
T. Penttila, B. Williams. Regular packings of PG(3, q). European J. Combin. 19, no. 6 (1998), 713–720.
A. R. Prince. Parallelisms of PG(3, 3) invariant under a collineation of order 5. In: Mostly finite geometries (Iowa City, IA, 1996) (Ed. Johnson N. L.), 383–390. Lecture Notes in Pure and Appl. Math., vol. 190, New York, Marcel Dekker, 1997.
A. R. Prince. Uniform parallelisms of PG(3, 3). In: Geometry, combinatorial designs and related structures (Spetses, 1996) (Eds Hirschfeld J., Magliveras S., Resmini M.), 193–200. London Math. Soc. Lecture Note Ser., vol. 245. Cambridge, Cambridge Univ. Press, 1997.
A. R. Prince. The cyclic parallelisms of PG(3, 5). European J. Combin. 19, no. 5 (1998), 613–616.
S. Ruj, J. Seberry, B. Roy. Key predistribution schemes using block designs in wireless sensor networks. 12-th IEEE International Conference on Computational Science and Engineering, 2009, 873–878, doi: 10.1109/CSE.2009.35.
J. Sarmiento. Resolutions of PG(5, 2) with point-cyclic automorphism group. J. Combin. Des. 8, no. 1 (2000), 2–14.
N. V. Semakov, V. A. Zinov’ev. Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs. Probl. Peredachi Inform. 4, no. 2 (1968), 3–10 (in Russian); English translation in: Problems Inform. Transmission 4, no. 2 (1968), 1–7 (1971).
D. R. Stinson. Combinatorial Designs: Constructions and Analysis. New York, SpringerVerlag, 2004.
D. R. Stinson, S. A. Vanstone. Orthogonal packings in PG(5, 2),Aequationes Math. 31, no. 2–3 (1986), 159–168.
S. Topalova, S. Zhelezova. 2-spreads and transitive and orthogonal 2-parallelisms of PG(5, 2). Graph. Combin. 26, no. 5 (2010), 727–735.
S. Topalova, S. Zhelezova. On point-transitive and transitive deficiency one parallelisms of PG(3, 4). Des. Codes Cryptogr. 75, no. 1 (2015), 9–19.
S. Topalova, S. Zhelezova. New regular parallelisms of PG(3, 5). J. Combin. Des. 24, no. 10 (2016), 473–482.
S. Topalova, S. Zhelezova. Types of spreads and duality of the parallelisms of PG(3, 5) with automorphisms of order 13. Des. Codes Cryptogr. 87, no. 2–3 (2019),495–507.
S. Topalova, S. Zhelezova. Backtrack search for parallelisms of projective spaces. In: Combinatorial algorithms (Eds Flocchini P., Moura L.) 544–557. Lecture Notes in Comput. Sci., vol. 12757. Cham, Springer, 2021.
S. Topalova, S. Zhelezova. Parallelisms of PG(3, 5) with an automorphism group of order 25. In: Extended Abstracts EuroComb 2021 (Eds Neˇsetˇril J., Perarnau G., Ru´e J., Serra O.), 668–674. Trends in Mathematics, vol. 14. Cham, Springer, 2021.
G. Zaicev, V. Zinoviev, N. Semakov. Interrelation of Preparata and Hamming codes and extension of Hamming codes to new double-error-correcting codes. In: Proc. Sec. Intern. Symp. on Information Theory, (Armenia, USSR, 1971), Budapest, Academiai Kiado, (1973), 257–263.
M. Walker. Spreads covered by derivable partial spreads. J. Combin. Theory Ser. A 38, no. 2 (1985), 113–130.
C. T. White. Two cyclic arrangement problems in finite projective geometry: Parallelisms and two-intersection set, Ph.D. Thesis, California Institute of Technology, 2002.
S. Zhelezova. Cyclic parallelisms of PG(5, 2). Mathematica Balkanica (N.S.) 24, no. 1–2, (2010), 141–146.
