REVIEW 2 cited by
Thin Hessenberg Pairs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
A square matrix is called {\it Hessenberg} whenever each entry below the subdiagonal is zero and each entry on the subdiagonal is nonzero. Let $V$ denote a nonzero finite-dimensional vector space over a field $\fld$. We consider an ordered pair of linear transformations $A: V \to V$ and $A^*: V \to V$ which satisfy both (i), (ii) below. \begin{enumerate} \item There exists a basis for $V$ with respect to which the matrix representing $A$ is Hessenberg and the matrix representing $A^*$ is diagonal. \item There exists a basis for $V$ with respect to which the matrix representing $A$ is diagonal and the matrix representing $A^*$ is Hessenberg. \end{enumerate} \noindent We call such a pair a {\it thin Hessenberg pair} (or {\it TH pair}). This is a special case of a {\it Hessenberg pair} which was introduced by the author in an earlier paper. We investigate several bases for $V$ with respect to which the matrices representing $A$ and $A^*$ are attractive. We display these matrices along with the transition matrices relating the bases. We introduce an "oriented" version of $A,A^*$ called a TH system. We classify the TH systems up to isomorphism.
Forward citations
Cited by 2 Pith papers
-
Variations on a circular Hessenberg pair
Quasi-circular Hessenberg systems and systems satisfying the tridiagonal relations are the same family; the tridiagonal-relations family splits exactly into the circular and tridiagonal-Hessenberg cases.
-
Circular Hessenberg pairs and the tridiagonal relations
Every circular Hessenberg pair on a finite-dimensional vector space satisfies the two tridiagonal relations.
Discussion (0). Continue with ORCID to comment.