A direct bijective proof of the hook-length formula.
A discontinuity in the distribution of fixed point sums.
A divisibility property of binomial coefficients viewed as an elementary sieve.
A duality based proof of the combinatorial nullstellensatz.
A fast algorithm for MacMahon's partition analysis.
A Foata bijection for the alternating group and for -analogues.
A formula for the generating functions of powers of Horadam's sequence with two additional parameters.
A functional combinatorial central limit theorem.
A game of composing binary relations
A generalization of combinatorial Nullstellensatz.
A Generalization of Functions !n and n!
A Generalization of Hanani's Theorem on Partial Order.
A generalization of Pascal’s triangle using powers of base numbers
In this paper we generalize the Pascal triangle and examine the connections among the generalized triangles and powering integers respectively polynomials. We emphasize the relationship between the new triangles and the Pascal pyramids, moreover we present connections with the binomial and multinomial theorems.
A generalization of Simion-Schmidt's bijection for restricted permutations.
A generalization of Stirling numbers of the second kind via a special multiset.
A generalization of the dichromatic polynomial of a graph.
A Generalization of the Matrix-Tree Theorem.
A generalized formula of Hardy.
A generalized major index statistic.
A generating functions proof of a curious identity.