Max Determinant

Determinants of special square matrices with elements defined as the Maximum or Minimum of the Indices
Author
Published

March 5, 2022

Plot3D of max matrix elements

1 Identity

The sequence A181983(n) gives the determinants of the square matrices: MnM_{n}, where the elements mi,j=max(i,j)m_{i,j}= \max(i,j) and max\max denotes the maximum function.

This identity appears as follows:

det[max(i,j)]1i,jn=n(1)n=A181983(n)\begin{equation} det{\bigg[ max(i,j) \bigg] }_{1\leq i,j \leq n} = -n \cdot {(-1)}^{n} = A181983(n) \end{equation}

2 Proof

A new matrix with the same determinant can be created by subtracting row ii from row i+1i+1 starting from the 2nd row. The determinant of this new matrix can then be easily computed using the expansion by minors technique at element m1,nm_{1,n}

This can be better illustrated with an example:

We can transform:

M10=(12345678910223456789103334567891044445678910555556789106666667891077777778910888888889109999999991010101010101010101010)\begin{equation} M_{10} = \left(\begin{array}{cccccccccc} 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ 2 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ 3 & 3 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ 4 & 4 & 4 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ 5 & 5 & 5 & 5 & 5 & 6 & 7 & 8 & 9 & 10 \\ 6 & 6 & 6 & 6 & 6 & 6 & 7 & 8 & 9 & 10 \\ 7 & 7 & 7 & 7 & 7 & 7 & 7 & 8 & 9 & 10 \\ 8 & 8 & 8 & 8 & 8 & 8 & 8 & 8 & 9 & 10 \\ 9 & 9 & 9 & 9 & 9 & 9 & 9 & 9 & 9 & 10 \\ 10 & 10 & 10 & 10 & 10 & 10 & 10 & 10 & 10 & 10 \end{array} \right) \end{equation}

Into:

M10=(12345678910100000000011000000001110000000111100000011111000001111110000111111100011111111001111111110)\begin{equation} M^{*}_{10} =\left(\begin{array}{cccccccccc} 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\ 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 \end{array} \right) \end{equation}

This proof can be generalized to a very similar type of matrices, resulting in:

det[max(i,j)k]1i,jn=(1)n1nks=1n1(s+1)ksk\begin{equation} det{\bigg[ max(i,j)^k \bigg]}_{1\leq i,j \leq n} = {(-1)}^{n-1} \cdot n^{k} \cdot \prod_{s=1}^{n-1}{(s+1)^k-s^k} \end{equation}

det[min(i,j)k]1i,jn=s=1n1(s+1)ksk\begin{equation} det{\bigg[ min(i,j)^k \bigg]}_{1\leq i,j \leq n} = \prod_{s=1}^{n-1}{(s+1)^k-s^k} \end{equation}

3 References