Enumeration of weighted paths on a digraph and block hook determinant
From MaRDI portal
(Redirected from Publication:825568)
Abstract: In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely. In addition we give a combinatorial interpretation of the aforesaid factorization property by counting weighted paths in a suitable weighted digraph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3891279 (Why is no real title available?)
- A Course in Enumeration
- A combinatorial proof of Newton's identities
- Advanced determinant calculus
- Advanced determinant calculus: a complement
- Binomial determinants, paths, and hook length formulae
- Combinatorial proofs of some determinantal identities
- Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities
- Determinants and perfect matchings
- Determinants of block tridiagonal matrices
- Matrix methods for determinants of Pascal-like matrices
- Maximizing the determinant for a special class of block-partitioned matrices
- Spiral determinants
Cited in
(2)
This page was built for publication: Enumeration of weighted paths on a digraph and block hook determinant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825568)