{"title":"带有广义莱昂纳多数项的托普利兹-海森堡矩阵的确定性","authors":"T. Goy, M. Shattuck","doi":"10.2478/amsil-2023-0027","DOIUrl":null,"url":null,"abstract":"Abstract Let un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers. In this paper, we find expressions for the determinants of several Toeplitz–Hessenberg matrices having generalized Leonardo number entries. These results are obtained as special cases of more general formulas for the generating function of the corresponding sequence of determinants. Special attention is paid to the cases 1 ≤ k ≤ 7, where several connections are made to entries in the On-Line Encyclopedia of Integer Sequences. By Trudi’s formula, one obtains equivalent multi-sum identities involving sums of products of generalized Leonardo numbers. Finally, in the case k = 1, we also provide combinatorial proofs of the determinant formulas, where we make extensive use of sign-changing involutions on the related structures.","PeriodicalId":52359,"journal":{"name":"Annales Mathematicae Silesianae","volume":"5 4","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Determinants of Toeplitz–Hessenberg Matrices with Generalized Leonardo Number Entries\",\"authors\":\"T. Goy, M. Shattuck\",\"doi\":\"10.2478/amsil-2023-0027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Let un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers. In this paper, we find expressions for the determinants of several Toeplitz–Hessenberg matrices having generalized Leonardo number entries. These results are obtained as special cases of more general formulas for the generating function of the corresponding sequence of determinants. Special attention is paid to the cases 1 ≤ k ≤ 7, where several connections are made to entries in the On-Line Encyclopedia of Integer Sequences. By Trudi’s formula, one obtains equivalent multi-sum identities involving sums of products of generalized Leonardo numbers. Finally, in the case k = 1, we also provide combinatorial proofs of the determinant formulas, where we make extensive use of sign-changing involutions on the related structures.\",\"PeriodicalId\":52359,\"journal\":{\"name\":\"Annales Mathematicae Silesianae\",\"volume\":\"5 4\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae Silesianae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/amsil-2023-0027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae Silesianae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/amsil-2023-0027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
摘要 让 un = un(k) 表示在 n≥2 时由 un = un-1 + un-2 + k 递归定义的广义莱昂纳多数,其中 u0 = u1 = 1。序列 un(1) 的项简称为莱昂纳多数。在本文中,我们找到了几个具有广义莱昂纳多数项的托普利兹-海森堡矩阵行列式的表达式。这些结果是作为相应行列式序列的生成函数的更一般公式的特例获得的。特别注意 1 ≤ k ≤ 7 的情况,其中有几处与《整数序列在线百科全书》中的条目有关。根据特鲁迪公式,我们可以得到涉及广义莱昂纳多数乘积之和的等价多和判定式。最后,在 k = 1 的情况下,我们还提供了行列式的组合证明,其中我们广泛使用了相关结构上的符号变化渐开线。
Determinants of Toeplitz–Hessenberg Matrices with Generalized Leonardo Number Entries
Abstract Let un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers. In this paper, we find expressions for the determinants of several Toeplitz–Hessenberg matrices having generalized Leonardo number entries. These results are obtained as special cases of more general formulas for the generating function of the corresponding sequence of determinants. Special attention is paid to the cases 1 ≤ k ≤ 7, where several connections are made to entries in the On-Line Encyclopedia of Integer Sequences. By Trudi’s formula, one obtains equivalent multi-sum identities involving sums of products of generalized Leonardo numbers. Finally, in the case k = 1, we also provide combinatorial proofs of the determinant formulas, where we make extensive use of sign-changing involutions on the related structures.