International audienceA multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov–Okounkov, the third one by Iqbal, Nazir, Raza and Saleem, who have made use of the cyclic symmetry of the topological vertex. A multiset hook-content formula is also proved
Partitions of an integer have found extensive application in combinatorics [1, 14, 17], group repres...
AbstractIn this paper, we define two kinds of hook lengths for internal vertices of complete m-ary t...
The celebrated hook-length formula of Frame, Robinson and Thrall from 1954 gives a product formula f...
AbstractA multiset hook length formula for integer partitions is established by using combinatorial ...
ABSTRACT. — We introduce a hook length expansion technique and explain how to discover old and new h...
Abstract. We present some conjectures and open problems on partition hook lengths, which are all mot...
The combinatorial theory of partitions has a number of applications including the representation the...
Abstract. In this short note we discuss recent results on hook length formulas of trees uni-fying so...
AbstractWe present a combinatorial proof of Postnikov’s hook length formula for binary trees
This paper presents a new proof of the hook-length formula, which computes the number of standard Yo...
Motivated in part by hook-content formulas for certain restricted partitions in representation theor...
International audienceWe introduce the difference operator for functions defined on strict partition...
AbstractA multiset hook length formula for integer partitions is established by using combinatorial ...
AbstractGiven a cell x in a skew diagram, the arm length a(x), the leg length ℓ(x), and therefore th...
This paper presents a new proof of the hook-length formula, which computes the number of standard ...
Partitions of an integer have found extensive application in combinatorics [1, 14, 17], group repres...
AbstractIn this paper, we define two kinds of hook lengths for internal vertices of complete m-ary t...
The celebrated hook-length formula of Frame, Robinson and Thrall from 1954 gives a product formula f...
AbstractA multiset hook length formula for integer partitions is established by using combinatorial ...
ABSTRACT. — We introduce a hook length expansion technique and explain how to discover old and new h...
Abstract. We present some conjectures and open problems on partition hook lengths, which are all mot...
The combinatorial theory of partitions has a number of applications including the representation the...
Abstract. In this short note we discuss recent results on hook length formulas of trees uni-fying so...
AbstractWe present a combinatorial proof of Postnikov’s hook length formula for binary trees
This paper presents a new proof of the hook-length formula, which computes the number of standard Yo...
Motivated in part by hook-content formulas for certain restricted partitions in representation theor...
International audienceWe introduce the difference operator for functions defined on strict partition...
AbstractA multiset hook length formula for integer partitions is established by using combinatorial ...
AbstractGiven a cell x in a skew diagram, the arm length a(x), the leg length ℓ(x), and therefore th...
This paper presents a new proof of the hook-length formula, which computes the number of standard ...
Partitions of an integer have found extensive application in combinatorics [1, 14, 17], group repres...
AbstractIn this paper, we define two kinds of hook lengths for internal vertices of complete m-ary t...
The celebrated hook-length formula of Frame, Robinson and Thrall from 1954 gives a product formula f...