**A trace bound for positive definite connected integer symmetric matrices.** / McKee, James; Yatsyna, Pavlo.

Research output: Contribution to journal › Article › peer-review

Published

Let A be a connected integer symmetric matrix, i.e., A=(a_ij)∈Mn(Z) for some n, A=A^T, and the underlying graph (vertices corresponding to rows, with vertex i joined to vertex j if a_ij≠0) is connected. We show that if all the eigenvalues of A are strictly positive, then tr(A)>=2n−1.

There are two striking corollaries. First, the analogue of the Schur–Siegel–Smyth trace problem is solved for characteristic polynomials of connected integer symmetric matrices. Second, we find new examples of totally real, separable, irreducible, monic integer polynomials that are not minimal polynomials of integer symmetric matrices.

There are two striking corollaries. First, the analogue of the Schur–Siegel–Smyth trace problem is solved for characteristic polynomials of connected integer symmetric matrices. Second, we find new examples of totally real, separable, irreducible, monic integer polynomials that are not minimal polynomials of integer symmetric matrices.

Original language | English |
---|---|

Pages (from-to) | 227-230 |

Number of pages | 4 |

Journal | Linear Algebra and Its Applications |

Volume | 444 |

DOIs | |

Publication status | Published - 1 Mar 2014 |

This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 18401093