Sciweavers

6 search results - page 1 / 2
» The weighted hook length formula
Sort
View
JCT
2011
83views more  JCT 2011»
12 years 10 months ago
The weighted hook length formula
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The firs...
Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pa...
EJC
2008
13 years 3 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 3 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen
JCT
2007
97views more  JCT 2007»
13 years 3 months ago
What power of two divides a weighted Catalan number?
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
Alexander Postnikov, Bruce E. Sagan