Self-Inverse Integer Matrices

Hanson, Robert

doi:10.1080/07468342.1985.11972879

The College Mathematics Journal

1985

DOI: 10.1080/07468342.1985.11972879

|View full text |Cite

Self-Inverse Integer Matrices

Robert Hanson

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2021

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Square Integer Matrix with a Single Non-Integer Entry in Its Inverse

2021

View full text Add to dashboard Cite

Matrix inversion is one of the most significant operations on a matrix. For any non-singular matrix A∈Zn×n, the inverse of this matrix may contain countless numbers of non-integer entries. These entries could be endless floating-point numbers. Storing, transmitting, or operating such an inverse could be cumbersome, especially when the size n is large. The only square integer matrix that is guaranteed to have an integer matrix as its inverse is a unimodular matrix U∈Zn×n. With the property that det(U)=±1, then U−1∈Zn×n is guaranteed such that UU−1=I, where I∈Zn×n is an identity matrix. In this paper, we propose a new integer matrix G˜∈Zn×n, which is referred to as an almost-unimodular matrix. With det(G˜)≠±1, the inverse of this matrix, G˜−1∈Rn×n, is proven to consist of only a single non-integer entry. The almost-unimodular matrix could be useful in various areas, such as lattice-based cryptography, computer graphics, lattice-based computational problems, or any area where the inversion of a large integer matrix is necessary, especially when the determinant of the matrix is required not to equal ±1. Therefore, the almost-unimodular matrix could be an alternative to the unimodular matrix.

show abstract

Square Integer Matrix with a Single Non-Integer Entry in Its Inverse

2021

View full text Add to dashboard Cite

show abstract

On Self-Inverse Binary Matrices Over the Binary Galois Field

Rushdi¹

2013

Journal of Mathematics and Statistics

View full text Add to dashboard Cite

An important class of square binary matrices over the simplest finite or Galois Field GF(2) is the class of involutory or Self-Inverse (SI) matrices. These matrices are of significant utility in prominent engineering applications such as the study of the Preparata Transformation or the analysis of synchronous Boolean Networks. Therefore, it is essential to devise appropriate methods, not only for understanding the properties of these matrices, but also for characterizing and constructing them. We survey square binary matrices of orders 1, 2 and 3 to identify primitive SI matrices among them. Larger SI matrices are constructed as (a) the direct sum, or (b) the Kronecker product, of smaller ones. Illustrative examples are given to demonstrate the construction and properties of binary SI matrices. The intersection of the sets of SI and permutation binary matrices is studied. We also study higher-order SI binary matrices and describe them via recursive relations or Kronecker products. Our work culminates in an exposition of the two most common representations of Boolean functions via two types of Boolean SI matrices. A better understanding of the properties and methods of constructing SI binary matrices over GF (2) is achieved. A clearer picture is attained about the utility of binary matrices in the representation of Boolean functions

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Self-Inverse Integer Matrices

Cited by 2 publications

References 2 publications

Square Integer Matrix with a Single Non-Integer Entry in Its Inverse

Square Integer Matrix with a Single Non-Integer Entry in Its Inverse

On Self-Inverse Binary Matrices Over the Binary Galois Field

Contact Info

Product

Resources

About