Anton Betten , Svetlana Topalova , Stela Zhelezova
{"title":"On parallelisms of PG(3,4) with automorphisms of order 2","authors":"Anton Betten , Svetlana Topalova , Stela Zhelezova","doi":"10.1016/j.ic.2024.105201","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span> be the <em>n</em>-dimensional projective space over the finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>. A <em>spread</em> in <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span> is a set of mutually skew lines which partition the point set. A <em>parallelism</em> is a partition of the set of lines by spreads. The classification of parallelisms in small finite projective spaces is of interest for problems from projective geometry, design theory, network coding, error-correcting codes, and cryptography. All parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span> and <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>3</mn><mo>)</mo></math></span> are known. Parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> which are invariant under automorphisms of odd prime orders have also been classified. The present paper contributes to the classification of parallelisms in <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> with automorphisms of even order. We focus on cyclic groups of order four and the group of order two generated by a Baer involution. We examine invariants of the parallelisms such as the full automorphism group, the type of spreads and questions of duality. The results given in this paper show that the number of parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> is at least 8675365. Some future directions of research are outlined.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105201"},"PeriodicalIF":0.8000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S089054012400066X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Let be the n-dimensional projective space over the finite field . A spread in is a set of mutually skew lines which partition the point set. A parallelism is a partition of the set of lines by spreads. The classification of parallelisms in small finite projective spaces is of interest for problems from projective geometry, design theory, network coding, error-correcting codes, and cryptography. All parallelisms of and are known. Parallelisms of which are invariant under automorphisms of odd prime orders have also been classified. The present paper contributes to the classification of parallelisms in with automorphisms of even order. We focus on cyclic groups of order four and the group of order two generated by a Baer involution. We examine invariants of the parallelisms such as the full automorphism group, the type of spreads and questions of duality. The results given in this paper show that the number of parallelisms of is at least 8675365. Some future directions of research are outlined.
期刊介绍:
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking