Questions tagged [unimodular-matrices]

A unimodular matrix is a matrix whose determinant is $\pm 1$. Often, but not always, its entries are integers.

An integer unimodular matrix is a matrix $M$ with $m_{ij}\in \mathbb{Z}$ and $\det(M)=\pm 1$. Note that upper and lower integer matrices with $1$ on the main diagonal, such as Pascal matrices, are unimodular. The unimodular matrices of a fixed dimension $n\times n$ form a group under matrix multiplication.

One generalization allows for the entries of $M$ to be in $F[x]$ for some field $F$ and then requiring the determinant to be a unit of $F[x]$, which implies the entries of $M^{-1}$ are in $F[x]$ as well.

A related concept is totally unimodular: a matrix $M$ is totally unimodular if every square submatrix has determinant $-1,0,1$.

See also:

63 questions
36
votes
6 answers

Integer matrices with integer inverses

If all entries of an invertible matrix $A$ are rational, then all the entries of $A^{-1}$ are also rational. Now suppose that all entries of an invertible matrix $A$ are integers. Then it's not necessary that all the entries of $A^{-1}$ are…
anonymous
11
votes
1 answer

How can you verify that a 3 by 3 unimodular matrix generates an infinite number of Fermat near misses?

I am interested in finding 3 by 3 Ramanujan-Hirschhorn matrices. By definition, a Ramanujan-Hirschhorn matrix is a 3 by 3 matrix which produces an infinite number of Fermat near misses. Ramanujan in his "lost notebook" makes the amazing claim that…
6
votes
1 answer

Can every symmetric, unimodular and positive definite $G\in\mathbb{Z}^{n\times n}$ be written as $G=U^TU$?

Let $G\in\mathbb{Z}^{n\times n}$ be symmetric, unimodular and positive definite. Does there exist a unimodular matrix $U\in\mathbb{Z}^{n\times n}$ such that $G=U^TU$? I now that the result is true if $n=2$, but I have a feeling that it fails if $n$…
5
votes
1 answer

When is an invertible symmetric logic matrix unimodular?

I am currently interested in invertible symmetric logical matrices, or, $(0,1)$-matrices, i.e., $n \times n$ matrices whose entries are either $0$ or $1$ (integers). I noticed that many invertible symmetric logical matrices that arise naturally from…
5
votes
1 answer

Given unimodular matrices $A, B$, solve the matrix equation $T^\top A T = B$

Given two symmetric integer unimodular matrices $A$ and $B$ with $\det A = \det B = \pm 1$. How do we find any integer unimodular matrices $T$ such that $$ T^\top A T = B? $$ Here $T^\top$, denotes the transpose of $T$. As an example, here are the…
5
votes
1 answer

Is this block matrix totally unimodular?

Suppose matrix $A \in \mathbb{R}^{m×n}$ has the consecutive ones property and, thus, is totally unimodular. Is the following block matrix also totally unimodular (TU)? $$B = \begin{pmatrix} A & 0 & \dots & 0\\ 0 & A & \dots & 0\\ …
5
votes
2 answers

Is this block matrix also totally unimodular?

Suppose matrix $A\in \mathbb R^{m\times n}$ is totally unimodular (TUM). Is the following matrix also TUM? $$ \begin{pmatrix} A & 0 & 0 \\ 0 & A & 0 \\ 0 & 0 & A\\ I & I & I\\ \end{pmatrix} $$ Thanks.
4
votes
0 answers

On the distribution of unimodular matrices generated by the Hermite normal form

A problem I'm currently considering requires me to generate (pseudo-)random Gaussian integer matrices with Gaussian integer matrix inverses. By analogy with an algorithm I know for generating random orthogonal matrices, I considered an algorithm…
4
votes
0 answers

Infinitely many Ramanujan-type sum of cubes and unimodular matrices?

I. Identities Ramanujan's sum of cubes identity is defined by the generating functions (easily calculated by Wolfram), \begin{aligned} \sum_{n=0}^\infty a_{n} x^n &= \frac{1+53x+9x^2}{1-82x-82x^2+x^3} = 1,135,11151,\dots\\ \sum_{n=0}^\infty b_{n}…
4
votes
0 answers

How to find a sparse lattice basis?

I am working with lattice codes (see here, or here) and facing the following problem: I have a set of $k$ vectors $\left\{v_1,\ldots,v_k\right\}$ which I know generate an $n$-dimensional, full-rank lattice, in the sense that any lattice vector can…
4
votes
1 answer

Why is a unimodular lattice self-dual?

Let $V$ be a real inner product space of dimension $n$ where the inner product is non-degenerate, but not necessarily positive-definite. (Thus there is an adjoint map $^\dagger$, and in the case that $V$ is Euclidean, the adjoint in the standard…
Ben Mares
  • 481
3
votes
0 answers

Ring of invariants of unimodular matrices acting on real square matrices

Suppose that $M(\Bbb R,n)$ is the set of all $n \times n$ square real matrices. The special linear group $\text{SL}(\Bbb R,n)$ acts on this group via right-multiplication. It is easy to see that the determinant will be preserved under the group…
3
votes
2 answers

When is the adjacency matrix of a simple undirected graph totally unimodular?

I would like to know the graphs for which the (node-node) adjacency matrix is totally unimodular. Is the following true? The adjacency matrix of G is totally unimodular if and only if G is a tree.
2
votes
1 answer

Rings with unimodular matrices containing at least one unit

Let $R$ be a ring with the following property: "Every unimodular matrix (ie. with a determinant that is a unit in $R$) contains at least one entry that is a unit in $R$." It looks like a very natural property that must have been studied before. What…
2
votes
0 answers

A question on showing $f$ is topological transitive.

Consider $\mathbb{T}^2=\mathbb{R}^2/\mathbb{Z}^2$ and the following unimodular matrix \begin{equation} A=\begin{bmatrix} 2& 1\\ 1& 1 \end{bmatrix}. \end{equation} We know $F\colon\mathbb{R}\rightarrow\mathbb{R}$, $F(\mathbf{v})=A\mathbf{v}$ induces…
1
2 3 4 5