Search arXivSearch

arXiv · 2607.16964

Variations on a circular Hessenberg pair

Abstract

A square matrix is called Hessenberg whenever each entry below the subdiagonal is zero and each entry on the subdiagonal is nonzero. A Hessenberg pair is an ordered pair of diagonalizable linear maps on a nonzero finite-dimensional vector space, that each act on an eigenbasis of the other one in a Hessenberg fashion. A Hessenberg system $Φ$ an `oriented' version of a Hessenberg pair. It is known that $Φ$ is determined up to isomorphism by its parameter array; this consists of the eigenvalue sequence of $Φ$, the dual eigenvalue sequence of $Φ$, and a sequence of nonzero scalars $\{ϕ_i\}_{i=1}^d$ called the split sequence of $Φ$. We are interested in some types of Hessenberg matrices, said to be circular, quasi-circular, tridiagonal, and irreducible tridiagonal. We are interested in the families of Hessenberg systems for which the associated Hessenberg matrices have one of the above types. A Hessenberg system of irreducible tridiagonal type is often called a Leonard system. In this case the associated Hessenberg pair satisfies two relations, called the tridiagonal relations. We are interested in the family of Hessenberg systems for which the associated Hessenberg pair satisfies the tridiagonal relations. We are also interested in the family of Hessenberg systems for which the eigenvalue sequence and dual eigenvalue sequence satisfy a linear three-term recurrence. In the present paper we have two main goals. First, we show how the above families of Hessenberg systems are related to each other. Second, we describe each family in terms of the parameter array.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kazumasa Nomura, Paul Terwilliger. 2026-07-18. Variations on a circular Hessenberg pair. https://arxiv.org/abs/2607.16964

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO