Skip to main content
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Source Link

We have a simple graph with vertices $\{v_1, v_2, ... v_n\}$.

The adjacency matrix of this graph is $A= (a_{ij})$ so that

  • $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence;

  • $a_{ij}=0$ if $i+j$ doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix is $0$ when $n$ is odd. And that when $n$ is even, it is $1$, $-1$ or $0$.

How can we prove this claim?

Edit: on MSEon MSE, the OP added that $a_{ii}=0$ along the diagonal which is confirmed by the OP's observation that the determinant should be zero in the odd case (e.g. $n=1,3$ do yield $0$ then). So in particular, this is not a Hankel transform.

We have a simple graph with vertices $\{v_1, v_2, ... v_n\}$.

The adjacency matrix of this graph is $A= (a_{ij})$ so that

  • $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence;

  • $a_{ij}=0$ if $i+j$ doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix is $0$ when $n$ is odd. And that when $n$ is even, it is $1$, $-1$ or $0$.

How can we prove this claim?

Edit: on MSE, the OP added that $a_{ii}=0$ along the diagonal which is confirmed by the OP's observation that the determinant should be zero in the odd case (e.g. $n=1,3$ do yield $0$ then). So in particular, this is not a Hankel transform.

We have a simple graph with vertices $\{v_1, v_2, ... v_n\}$.

The adjacency matrix of this graph is $A= (a_{ij})$ so that

  • $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence;

  • $a_{ij}=0$ if $i+j$ doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix is $0$ when $n$ is odd. And that when $n$ is even, it is $1$, $-1$ or $0$.

How can we prove this claim?

Edit: on MSE, the OP added that $a_{ii}=0$ along the diagonal which is confirmed by the OP's observation that the determinant should be zero in the odd case (e.g. $n=1,3$ do yield $0$ then). So in particular, this is not a Hankel transform.

The question is still unanswered on MSE and MO after 5 months. The MO version required a clarification, namely that the diagonal is of the matrix is zero (as mentioned on the MSE version) which agrees with the OP's claim for small values of $n$.
Source Link

weWe have a simple graph that it'swith vertices are {v_1, v_2, ... v_n}$\{v_1, v_2, ... v_n\}$.

The Adjacencyadjacency matrix ofof this graph is A= (a_ij)$A= (a_{ij})$ so that;that

(a_ij)=1 if i+j belongs to the Fibonacci sequence. (a_ij)=0 if i+j doesn't belong to the Fibonacci sequence.

  • $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence;

  • $a_{ij}=0$ if $i+j$ doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix is $0$ when n$n$ is odd is 0 and. And that when n$n$ is even, it is 1 or -1$1$, $-1$ or 0$0$. How

How can we prove this claim?

Edit: on MSE, the OP added that $a_{ii}=0$ along the diagonal which is confirmed by the OP's observation that the determinant should be zero in the odd case (e.g. $n=1,3$ do yield $0$ then). So in particular, this is not a Hankel transform.

we have a simple graph that it's vertices are {v_1, v_2, ... v_n}.

The Adjacency matrix of this graph is A= (a_ij) so that;

(a_ij)=1 if i+j belongs to the Fibonacci sequence. (a_ij)=0 if i+j doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix when n is odd is 0 and when n is even is 1 or -1 or 0. How can we prove this claim?

We have a simple graph with vertices $\{v_1, v_2, ... v_n\}$.

The adjacency matrix of this graph is $A= (a_{ij})$ so that

  • $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence;

  • $a_{ij}=0$ if $i+j$ doesn't belong to the Fibonacci sequence.

We claim that the determinant of this matrix is $0$ when $n$ is odd. And that when $n$ is even, it is $1$, $-1$ or $0$.

How can we prove this claim?

Edit: on MSE, the OP added that $a_{ii}=0$ along the diagonal which is confirmed by the OP's observation that the determinant should be zero in the odd case (e.g. $n=1,3$ do yield $0$ then). So in particular, this is not a Hankel transform.

edited tags
Link
Jernej
  • 3.5k
  • 1
  • 27
  • 41
retagged
Link
Yemon Choi
  • 25.8k
  • 9
  • 69
  • 156
Loading
fixed a couple of typos
Source Link
Gerry Myerson
  • 39.9k
  • 10
  • 186
  • 247
Loading
Source Link
zoha
  • 41
  • 1
Loading