Academic Journal
Προβολή σε EDS

On Invertibility of Large Binary Matrices

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: On Invertibility of Large Binary Matrices
Συγγραφείς: Ibrahim Mammadov, Pavel Loskot, Thomas Honold
Πηγή: Mathematics ; Volume 14 ; Issue 2 ; Pages: 270
Στοιχεία εκδότη: Multidisciplinary Digital Publishing Institute
Έτος έκδοσης: 2026
Συλλογή: MDPI Open Access Publishing
Θεματικοί όροι: algorithm complexity, Bruhat decomposition, binary matrix, Galois field, matrix inverse, PLU factorization, Strassen algorithm, matrix multiplication
Περιγραφή: Many data processing applications involve binary matrices for storing digital information. At present, there are limited results in the literature about algorithms for inverting large binary matrices. This paper contributes the following three results. First, the divide-and-conquer methods for efficiently inverting large matrices over finite fields such as Strassen’s matrix inversion often fail on singular sub-blocks, even if the original matrix is non-singular. It is proposed to combine Strassen’s method with the PLU factorization at each recursive step in order to obtain robust pivoting, which correctly inverts all non-singular matrices over any finite field. The resulting algorithm is shown to maintain the sub-cubic time complexity. Second, although there are theoretical studies on how to systematically enumerate all invertible matrices over finite fields without redundancy, no practical algorithm has been reported in the literature that is easy to understand and also suitable for enumerating large matrices. The use of Bruhat decomposition has been proposed to enumerate all invertible matrices. It leverages the linear group-theoretic structure and defines an ordered sequence of invertible matrices, so that each matrix is generated exactly once. Third, large binary matrices have about 29% probability to be invertible. In some applications, it may be desirable to repair the singular matrices by performing a small number of bit-flips. It is shown that the minimum number of bit-flips is equal to the matrix rank deficiency, i.e., the minimum Hamming distance from the general linear group. The required bit-flips are identified by pivoting during the matrix inversion, so the matrix rank can be restored. The correctness and the time complexity of the proposed algorithms were verified both theoretically and empirically. The reference implementation of these algorithms in C++ is available on Github.
Τύπος εγγράφου: text
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
Relation: C: Mathematical Analysis; https://dx.doi.org/10.3390/math14020270
DOI: 10.3390/math14020270
Διαθεσιμότητα: https://doi.org/10.3390/math14020270
Rights: https://creativecommons.org/licenses/by/4.0/
Αριθμός Καταχώρησης: edsbas.FB5AF016
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.3390/math14020270#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.FB5AF016
RelevancyScore: 1025
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1024.80883789063
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On Invertibility of Large Binary Matrices
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ibrahim+Mammadov%22">Ibrahim Mammadov</searchLink><br /><searchLink fieldCode="AR" term="%22Pavel+Loskot%22">Pavel Loskot</searchLink><br /><searchLink fieldCode="AR" term="%22Thomas+Honold%22">Thomas Honold</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Mathematics ; Volume 14 ; Issue 2 ; Pages: 270
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Multidisciplinary Digital Publishing Institute
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2026
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: MDPI Open Access Publishing
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22algorithm+complexity%22">algorithm complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Bruhat+decomposition%22">Bruhat decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22binary+matrix%22">binary matrix</searchLink><br /><searchLink fieldCode="DE" term="%22Galois+field%22">Galois field</searchLink><br /><searchLink fieldCode="DE" term="%22matrix+inverse%22">matrix inverse</searchLink><br /><searchLink fieldCode="DE" term="%22PLU+factorization%22">PLU factorization</searchLink><br /><searchLink fieldCode="DE" term="%22Strassen+algorithm%22">Strassen algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22matrix+multiplication%22">matrix multiplication</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Many data processing applications involve binary matrices for storing digital information. At present, there are limited results in the literature about algorithms for inverting large binary matrices. This paper contributes the following three results. First, the divide-and-conquer methods for efficiently inverting large matrices over finite fields such as Strassen’s matrix inversion often fail on singular sub-blocks, even if the original matrix is non-singular. It is proposed to combine Strassen’s method with the PLU factorization at each recursive step in order to obtain robust pivoting, which correctly inverts all non-singular matrices over any finite field. The resulting algorithm is shown to maintain the sub-cubic time complexity. Second, although there are theoretical studies on how to systematically enumerate all invertible matrices over finite fields without redundancy, no practical algorithm has been reported in the literature that is easy to understand and also suitable for enumerating large matrices. The use of Bruhat decomposition has been proposed to enumerate all invertible matrices. It leverages the linear group-theoretic structure and defines an ordered sequence of invertible matrices, so that each matrix is generated exactly once. Third, large binary matrices have about 29% probability to be invertible. In some applications, it may be desirable to repair the singular matrices by performing a small number of bit-flips. It is shown that the minimum number of bit-flips is equal to the matrix rank deficiency, i.e., the minimum Hamming distance from the general linear group. The required bit-flips are identified by pivoting during the matrix inversion, so the matrix rank can be restored. The correctness and the time complexity of the proposed algorithms were verified both theoretically and empirically. The reference implementation of these algorithms in C++ is available on Github.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: C: Mathematical Analysis; https://dx.doi.org/10.3390/math14020270
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.3390/math14020270
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.3390/math14020270
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: https://creativecommons.org/licenses/by/4.0/
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.FB5AF016
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.FB5AF016
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3390/math14020270
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: algorithm complexity
        Type: general
      – SubjectFull: Bruhat decomposition
        Type: general
      – SubjectFull: binary matrix
        Type: general
      – SubjectFull: Galois field
        Type: general
      – SubjectFull: matrix inverse
        Type: general
      – SubjectFull: PLU factorization
        Type: general
      – SubjectFull: Strassen algorithm
        Type: general
      – SubjectFull: matrix multiplication
        Type: general
    Titles:
      – TitleFull: On Invertibility of Large Binary Matrices
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ibrahim Mammadov
      – PersonEntity:
          Name:
            NameFull: Pavel Loskot
      – PersonEntity:
          Name:
            NameFull: Thomas Honold
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Mathematics ; Volume 14 ; Issue 2 ; Pages: 270
              Type: main
ResultId 1