کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4646815 1342314 2016 28 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Combinatorial families of multilabelled increasing trees and hook-length formulas
ترجمه فارسی عنوان
خانواده های ترکیبی از درختان در حال رشد و برچسب زدن طولانی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی

In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can get multiple labels.For all tree classes we show characterizations of suitable generating functions for the tree enumeration sequence via differential equations. Furthermore, for several combinatorial classes of multilabelled increasing tree families we present explicit enumeration results. We also present multilabelled increasing tree families of an elliptic nature, where the exponential generating function can be expressed in terms of the Weierstrass-℘℘ function or the lemniscate sine function.Furthermore, we show how to translate enumeration formulas for multilabelled increasing tree families into hook-length formulæ for trees.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 339, Issue 1, 6 January 2016, Pages 227–254
نویسندگان
, ,