A trace bound for positive definite connected 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.