On Vertically-Recurrent Matrices and Their Algebraic Properties

Abstract

In this paper, we first introduce the new class of vertically-recurrent matrices, using a generalization of "the Hockey stick and Puck theorem" in Pascal's triangle. Then, we give an interesting formula for the lower triangular decomposition of these matrices. We also deal with the m-th power of these matrices in some special cases. Furthermore, we present two important applications of these matrices for decomposing admissible matrices and matrices which arise in the theory of ladder networks. Finall,y we pose some open problems and conjectures about these new kind of matrices.

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…