English

A Combinatorial Formula for Recursive Operator Sequences and Applications

Functional Analysis 2026-05-12 v2

Abstract

We study sequences of bounded operators (Tn)n0(T_n)_{n \ge 0} on a complex separable Hilbert space H\mathcal{H} that satisfy a linear recurrence relation of the form Tn+r=A0Tn+A1Tn+1++Ar1Tn+r1(for all n0), T_{n+r} = A_0 T_n + A_1 T_{n+1} + \cdots + A_{r-1} T_{n+r-1} \quad(\textrm{for all } n\ge 0), where the coefficients A0,A1,,Ar1A_0, A_1, \dots, A_{r-1} are pairwise commuting bounded operators on H\mathcal{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 TnT_n. 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=akIHA_k=a_kI_\mathcal{H}, with akRa_k\in\mathbb{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.

Keywords

Cite

@article{arxiv.2604.04320,
  title  = {A Combinatorial Formula for Recursive Operator Sequences and Applications},
  author = {Raul E. Curto and Abderrazzak Ech-charyfy and Kaissar Idrissi and El Hassan Zerouali},
  journal= {arXiv preprint arXiv:2604.04320},
  year   = {2026}
}
R2 v1 2026-07-01T11:54:47.747Z