Counting on Determinants
From MaRDI portal
Recommendations
- Viewing determinants as nonintersecting lattice paths yields classical determinantal identities bijectively
- Combinatorial proofs of some determinantal identities
- Binomial determinants, paths, and hook length formulae
- An extension of the Lindström-Gessel-Viennot theorem
- Matrices, Digraphs, and Determinants
Cited in
(18)- Binomial determinants, paths, and hook length formulae
- A matrix for counting paths in acyclic digraphs
- Hankel determinants of a linear combination of three successive Catalan numbers
- Flagged Schur polynomial duality via a lattice path bijection
- An extension of the Lindström-Gessel-Viennot theorem
- A Gessel--Viennot-type method for cycle systems in a directed graph
- The research and progress of the enumeration of lattice paths
- scientific article; zbMATH DE number 5936641 (Why is no real title available?)
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
- scientific article; zbMATH DE number 773166 (Why is no real title available?)
- Counting on matrices
- How many unicycles on a wheel?
- Fibonacci and Lucas identities from Toeplitz-Hessenberg matrices
- An ordered partition expansion of the determinant
- A Matrix for Counting Paths in Acyclic Colored Digraphs
- Enumeration of weighted paths on a digraph and block hook determinant
- Determinants of (generalised) Catalan numbers
- Visualizing Vandermonde's determinant through nonintersecting lattice paths
This page was built for publication: Counting on Determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295557)
