Questions tagged [combinatorial-proofs]

Combinatorial proofs include, for example, proofs using double counting or bijective proofs.

Filter by
Sorted by
Tagged with
12 votes
5 answers
810 views

A divisibility of q-binomial coefficients combinatorially

Let a and b be coprime positive integers. Then the number a+b divides the binomial coefficient ${a+b \choose a}$. I know how to prove this combinatorially - for example after choosing an ordered set ...
3 votes
0 answers
132 views

Expansion in Schur function of negative binomial exponent

I want to know if there exist a known expansion or can be derived of the polynomial $$ \prod_{i=1}^{m}\prod_{j= 1}^{n}(1-z(x_i + y_i))^{-w} \tag{*}$$ in terms of Schur function. That is asking for (*) ...
8 votes
2 answers
685 views

Seeking a combinatorial proof for a binomial identity

Let $n\geq m\geq0$ be two integers. The below binomial identity is provable by other means: $$\sum_{j=0}^m(-1)^j\binom{n+1}j2^{m-j} =\sum_{j=0}^m(-1)^j\binom{n-m+j}j.$$ QUESTION. Can you provide a ...
1 vote
1 answer
143 views

Proofs by Schubert calculus and combinatorics

Do you know some examples proved by two different methods: 1. Schubert calculus, 2. combinatorial method.