开花的树：整数分拆树与整数复合树目录及其渐近分析
Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
AI总结：
本文研究节点携带整数分拆或整数复合“花朵”的组合树类，给出花瓣权重与花朵权重的生成函数，并推导系数渐近增长及集中分布期望的通用公式。
摘要：
我们提出了若干组合类族，将其描述为节点可携带两类“花朵”之一的树：整数分拆或整数复合。我们考察树上花朵的两个参数：所有花朵中“花瓣”的数量（花瓣权重），以及所有花朵的花瓣中的边数（花朵权重）。我们给出了其生成函数的显式表达式，并推导出其系数渐近增长及其集中分布期望的通用公式。
英文摘要：
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of "petals" in all the flowers (petals' weight) and the number of edges in the petals of all the flowers (flowers' weight). We give explicit expressions of their generating functions and deduce general formulas for the asymptotic growth of their coefficients and the expectations of their concentrated distributions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
