MathOverflow Asked on December 7, 2020

In a homological algebra problem I am in the situation that I have an invertible (over $mathbb{Z}$) integer matrix $X$ and a permutation matrix $Y$ such that $N:=XY$ is a matrix with all eigenvalues equal to 1 or -1.

Question 1 : Does such a situation appear already in other situations/fields in algebra/combinatorics? Is there an interpretation for this or does it have a combinatorial meaning?

Question 2: Do (invertible integer) matrices with all eigenvalues equal to 1 or -1 have a name, or do matrices $X$ as above have a name? Are they studied in the literature?

If $N$ is diagonalizable then $N=Q Lambda Q^{−1,}$ hence $$N^2=Q Lambda Q^{−1} Q Lambda Q^{−1}=Q Lambda^2 Q^{−1}$$

Since this $Lambda$ is diagonal with $pm 1$ on its diagonal, $$Lambda^2=I_n$$

hence $N^2=QQ^{−1}=I_n$

These don't have (as far as I know) "names" but the properties may help you along the way.

Answered by Kevin on December 7, 2020

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- Peter Machado on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?
- haakon.io on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?
- Joshua Engel on Why fry rice before boiling?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP