کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4653926 1632799 2012 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Bilabelled increasing trees and hook-length formulae
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Bilabelled increasing trees and hook-length formulae
چکیده انگلیسی

We introduce two different kinds of increasing bilabellings of trees, for which we provide enumeration formulae. One of the bilabelled tree families considered is enumerated by the reduced tangent numbers and is in bijection with a tree family introduced by Poupard [11]. Both increasing bilabellings naturally lead to hook-length formulae for trees and forests; in particular, one construction gives a combinatorial interpretation of a formula for labelled unordered forests obtained recently by Chen et al. [1].

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 33, Issue 2, February 2012, Pages 248–258
نویسندگان
, ,