A combinatorial determinant
Herbert S. Wilf
Abstract
A theorem of Mina evaluates the determinant of a matrix with entries Dj(f(x)i). We note the important special case where the matrix entries are evaluated at x=0 and give a simple proof of it, and some applications. We then give a short proof of the general case.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell