For every integer $n\geq3$ define an $n\times n$ matrix $A$ using the following row vector as the first row: $(c_0,c_1,c_2,\ldots, c_{n-1})$ where $c_k=\cos (2\pi k/n)$.
The subsequent rows are obtained as cyclic shifts. This matrix seems to be always of rank 2.
Actually I was working with some families of representations of dihedral groups, arising in another context and was computing the degrees of the representations. That calculation implied this matrix should be of rank 2. But definitely there must be some direct way of doing it.
Can anyone tell me how to accomplish it?
The identity
$\cos((n+1)x) =2\cos(x)\cos(nx)-\cos((n-1)x) $ shows that each column is a linear combination of the previous two columns, so the rank is 2.
This also holds for $\sin$.