{"title":"On the study of semi-involutory and semi-orthogonal matrices","authors":"Yogesh Kumar , Susanta Samanta , P.R. Mishra , Atul Gaur","doi":"10.1016/j.ffa.2025.102730","DOIUrl":null,"url":null,"abstract":"<div><div>This paper investigates semi-involutory and semi-orthogonal matrices, presenting two algorithms for verifying these properties for <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> matrices over <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup></mrow><mrow><mo>⁎</mo></mrow></msubsup></math></span>. The algorithms significantly reduce computational complexity by avoiding the need for non-singular diagonal matrices. The structure of circulant matrices with these properties is also explored, including the derivation of the exact form of their corresponding diagonal matrices. We further investigate MDS matrices with semi-involutory and semi-orthogonal properties. We prove that semi-involutory circulant matrices of order <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup></mrow></msub></math></span>, where <span><math><mi>gcd</mi><mo></mo><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>=</mo><mn>1</mn></math></span>, cannot be MDS matrices. Additionally, we show that semi-orthogonal circulant matrices of order <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup></mrow></msub></math></span> cannot be MDS. Finally, explicit formulas for counting <span><math><mn>3</mn><mo>×</mo><mn>3</mn></math></span> semi-involutory and semi-orthogonal MDS matrices over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup></mrow></msub></math></span> are derived, and exact counts for <span><math><mn>4</mn><mo>×</mo><mn>4</mn></math></span> semi-involutory and semi-orthogonal MDS matrices over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup></mrow></msub></math></span> for <span><math><mi>m</mi><mo>=</mo><mn>3</mn></math></span> and 4 are provided.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"110 ","pages":"Article 102730"},"PeriodicalIF":1.2000,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001601","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper investigates semi-involutory and semi-orthogonal matrices, presenting two algorithms for verifying these properties for matrices over . The algorithms significantly reduce computational complexity by avoiding the need for non-singular diagonal matrices. The structure of circulant matrices with these properties is also explored, including the derivation of the exact form of their corresponding diagonal matrices. We further investigate MDS matrices with semi-involutory and semi-orthogonal properties. We prove that semi-involutory circulant matrices of order over , where , cannot be MDS matrices. Additionally, we show that semi-orthogonal circulant matrices of order over cannot be MDS. Finally, explicit formulas for counting semi-involutory and semi-orthogonal MDS matrices over are derived, and exact counts for semi-involutory and semi-orthogonal MDS matrices over for and 4 are provided.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.