Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper Hessenberg and Toeplitz Bohemians (1907.10677v1)

Published 23 Jul 2019 in cs.SC, cs.NA, and math.NA

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

We haven't generated a summary for this paper yet.