A Combinatorial Formula for Recursive Operator Sequences and Applications

Abstract

We study sequences of bounded operators \((Tn)n 0\) on a complex separable Hilbert space \(H\) that satisfy a linear recurrence relation of the form Tn+r = A0 Tn + A1 Tn+1 + ·s + Ar-1 Tn+r-1 (for all n 0), where the coefficients \(A0, A1, …, Ar-1\) are pairwise commuting bounded operators on \(H\). \ Such relations naturally arise in the context of the operator-valued moment problem, particularly in the study of flat extensions of block Hankel operators. \ Our first goal is to derive an explicit combinatorial formula for \(Tn\). As a concrete application, we provide an explicit expression for the powers of an operator-valued companion matrix. \ In the special case of scalar coefficients Ak=akIH, with ak∈R, we recover a Binet-type formula that allows the explicit computation of the powers and the exponential of algebraic operators in terms of Bell polynomials.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…