Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions related to teaching mathematics. For questions in Mathematics Education as a scientific discipline there is also the tag mathematics-education. Note you may also ask your question on http://matheducators.stackexchange.com/.
30
votes
Accepted
The Matrix-Tree Theorem without the matrix
A combinatorial proof of the matrix-tree theorem can be found in the paper by D. Zeilberger
A combinatorial approach to matrix algebra,
Discrete Math. 56 (1985), 61–72.
The proof uses only the interp …
7
votes
Seeking a combinatorial proof for a binomial identity
Here are some observations, though not quite a combinatorial proof of the identity in question.
Let $A(m,n)$ be the value of the sums. Let $B(m,n)=(-1)^m A(m, m+n)$. Then $B(m,n)$ is nonnegative for a …