<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2592</article-id>
      <title-group>
        <article-title>Computational algorithms for determinant evaluation of cyclic m-diagonal Toeplitz matrices</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Solary</surname>
            <given-names>Maryam Shams</given-names>
          </name>
          <aff>Department of Mathematics, Payame Noor University, Tehran, P. O. Box 19395-3697, Iran</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sadeghy</surname>
            <given-names>Ensieh</given-names>
          </name>
          <aff>Department of Mathematics, Payame Noor University, Tehran, P. O. Box 19395-3697, Iran</aff>
        </contrib>
      </contrib-group>
      <fpage>1</fpage>
      <lpage>18</lpage>
      <pub-date date-type="pub">
        <day>11</day>
        <month>05</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p> Cyclic m-diagonal matrices possessing a Toeplitz structure have been extensively studied in the contemporary literature. In this work, we propose two efficient numerical procedures for calculating the determinant of general cyclic m-diagonal matrices possessing a Toeplitz structure. The first procedure is based on converting the matrix into a 2-by-2 block matrix format, subsequently leveraging the inverse of this reformulated matrix. The second technique is based on a conversion to an upper triangular block matrix. The performance of these new algorithms is then benchmarked against established methods from prior research.</p>
      </abstract>
      <kwd-group>
        <kwd>Determinant</kwd>
        <kwd>Block matrix</kwd>
        <kwd>Cyclic</kwd>
        <kwd>m-diagonal</kwd>
        <kwd>Toeplitz matrix</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
