Indexed metadata

Explicit Formula and Matrix Representations of Generalized Third-Order Recurrence Relations

K. L. Verma

Source record

Source: Crossref

Published: Oct 19, 2026

DOI: 10.68676/saumat.1986491

Open original source ↗

Source abstract

This paper investigates third-order linear recurrence relations and derives an explicit formula for generalized tribonacci sequences in terms of the roots of their characteristic equations. Using these roots, we establish connections between generalized tribonacci sequences and matrix theory by introducing novel tetradiagonal and companion matrices. In particular, we prove that the n-th term of the sequence is identically equal to both the determinant of the associated tetradiagonal matrix and the first entry of the n-th power of the companion matrix. These determinant representations are further employed to derive several algebraic identities for the generalized tribonacci sequence, including a Vajda-type identity and related identities involving shifted terms. Finally, the resulting determinant and sequence identities are expressed explicitly through a double-summation formula, providing an alternative combinatorial representation of the general term.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.