Name
Abstract | ||
|---|---|---|
We look at Bohemian matrices, specifically those with entries from ${-1, 0, {+1}}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $pm1$. Many properties remain after these specializations, some of which surprised us. We find two recursive formulae for the characteristic polynomials of upper Hessenberg matrices. Focusing on only those matrices whose characteristic polynomials have maximal height allows us to explicitly identify these polynomials and give a lower bound on their height. This bound is exponential in the order of the matrix. We count stable matrices, normal matrices, and neutral matrices, and tabulate the results of our experiments. We prove a theorem about the only possible kinds of normal matrices amongst a specific family of Bohemian upper Hessenberg matrices. |
Year | Venue | DocType |
|---|---|---|
2018 | arXiv: Symbolic Computation | Journal |
Volume | Citations | PageRank |
abs/1809.10653 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eunice Y. S. Chan | 1 | 0 | 0.68 |
| Robert M. Corless | 2 | 143 | 21.54 |
| Laureano González-Vega | 3 | 137 | 28.69 |
| J. Rafael Sendra | 4 | 621 | 68.33 |
| Juana Sendra | 5 | 0 | 1.35 |
| Steven E. Thornton | 6 | 1 | 1.45 |