Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach

DOI10.54550/ECA2021V1S1R5zbMath1491.05029arXiv2009.06162MaRDI QIDQ5093420

Sudip Bera

Publication date: 26 July 2022

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.06162

zbMATH Keywords

wordsdeterminantsdigraphssymmetric functionscombinatorial proof

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• The combinatorialization of linear recurrences
• A combinatorial proof of Newton's identities
• Determinants and perfect matchings
• Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities
• Random Approaches to Fibonacci Identities
• Combinatorial proofs of some determinantal identities
• Powers of a matrix and combinatorial identities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach