Combinatorial proofs of some determinantal identities

DOI10.1080/03081087.2017.1366970zbMath1392.05013OpenAlexW2752363602WikidataQ113851279 ScholiaQ113851279MaRDI QIDQ4567773

Sajal Kumar Mukherjee, Sudip Bera

Publication date: 20 June 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1366970

zbMATH Keywords

Euler characteristicdeterminantsdigraphsfree monoidcombinatorial proof

Mathematics Subject Classification ID

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

Related Items (3)

Enumeration of weighted paths on a digraph and block hook determinant ⋮ Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach ⋮ Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities

Cites Work

• A matrix for counting paths in acyclic digraphs
• A Course in Enumeration

This page was built for publication: Combinatorial proofs of some determinantal identities