Add to ORKGRecently Han obtained a general formula for the weight function corresponding to the expansion of a series in terms of hook lengths of binary trees. In this paper, we present weight function formulas for k-ary trees, plane trees, plane forests, labeled trees and forests. We also find appropriate generating functions which lead to unifications of the hook length formulas due to Du and Liu, Han, Gessel and Seo, and Postnikov
We present a combinatorial proof of Postnikov’s hook length formula for binary trees. c © 2007 Elsev...
This paper is dedicated to the memory of Pierre Leroux. In fact, reference [8] was written while bot...
ABSTRACT. In this work we introduce and study various generalizations of the notion of increasingly ...
Abstract. In this short note we discuss recent results on hook length formulas of trees uni-fying so...
The original motivation for the study of hook length polynomials was to find a combinatorial proof f...
AbstractWe present a combinatorial proof of Postnikov’s hook length formula for binary trees
ABSTRACT. — We introduce a hook length expansion technique and explain how to discover old and new h...
Abstract. We present a combinatorial proof of Postnikov’s hook length formula for binary trees. AMS ...
AbstractWe introduce two different kinds of increasing bilabellings of trees, for which we provide e...
International audienceA number of hook formulas and hook summation formulas have previously appeared...
A number of hook formulas and hook summation formulas have previously appeared, involving various cl...
AbstractIn this paper, we define two kinds of hook lengths for internal vertices of complete m-ary t...
AbstractMotivated by a formula of A. Postnikov relating binary trees, we define the hook length poly...
AbstractBased on the ideas in Ciocan-Fontanine, Konvalinka and Pak (2009) [5], we introduce the weig...
Abstract. Recently Féray, Goulden and Lascoux gave a proof of a new hook summation formula for unor...
We present a combinatorial proof of Postnikov’s hook length formula for binary trees. c © 2007 Elsev...
This paper is dedicated to the memory of Pierre Leroux. In fact, reference [8] was written while bot...
ABSTRACT. In this work we introduce and study various generalizations of the notion of increasingly ...
Abstract. In this short note we discuss recent results on hook length formulas of trees uni-fying so...
The original motivation for the study of hook length polynomials was to find a combinatorial proof f...
AbstractWe present a combinatorial proof of Postnikov’s hook length formula for binary trees
ABSTRACT. — We introduce a hook length expansion technique and explain how to discover old and new h...
Abstract. We present a combinatorial proof of Postnikov’s hook length formula for binary trees. AMS ...
AbstractWe introduce two different kinds of increasing bilabellings of trees, for which we provide e...
International audienceA number of hook formulas and hook summation formulas have previously appeared...
A number of hook formulas and hook summation formulas have previously appeared, involving various cl...
AbstractIn this paper, we define two kinds of hook lengths for internal vertices of complete m-ary t...
AbstractMotivated by a formula of A. Postnikov relating binary trees, we define the hook length poly...
AbstractBased on the ideas in Ciocan-Fontanine, Konvalinka and Pak (2009) [5], we introduce the weig...
Abstract. Recently Féray, Goulden and Lascoux gave a proof of a new hook summation formula for unor...
We present a combinatorial proof of Postnikov’s hook length formula for binary trees. c © 2007 Elsev...
This paper is dedicated to the memory of Pierre Leroux. In fact, reference [8] was written while bot...
ABSTRACT. In this work we introduce and study various generalizations of the notion of increasingly ...