Papers
Topics
Authors
Recent
Search
2000 character limit reached

Upper Hessenberg and Toeplitz Bohemians

Published 23 Jul 2019 in cs.SC, cs.NA, and math.NA | (1907.10677v1)

Abstract: We look at Bohemians, specifically those with population ${-1, 0, {+1}}$ and sometimes ${0,1,i,-1,-i}$. More, we specialize the matrices to be upper Hessenberg Bohemian. From there, focusing on only those matrices whose characteristic polynomials have maximal height allows us to explicitly identify these polynomials and give useful bounds on their height, and conjecture an accurate asymptotic formula. The lower bound for the maximal characteristic height is exponential in the order of the matrix; in contrast, the height of the matrices remains constant. We give theorems about the numbers of normal matrices and the numbers of stable matrices in these families.

Citations (12)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.