Asymptotics of Smallest Component Sizes in Decomposable Combinatorial Structures of Alg-Log Type

作者：Dong Li^*; Gao Zhicheng; Panario Daniel; Richmond Bruce

来源：Discrete Mathematics and Theoretical Computer Science, 2010, 12(2): 197-222.

• decomposable structures
• restricted pattern
• labeled and unlabeled structures
• generating functions
• alg-logtype

A decomposable combinatorial structure consists of simpler objects called components which by thems elves cannot be further decomposed. We focus on the multi-set construction where the component generating function C(z) is of alg-log type, that is, C(z) behaves like
c + d(1 -z/rho)(alpha) (ln1/1-z/rho)(beta) (1 + o(1))
when z is near the dominant singularity rho. We provide asymptotic results about the size of thes mallest components in random combinatorial structures for the cases 0 < alpha < 1 and any beta, and alpha < 0 and beta=0. The particular case alpha=0 and beta=1, the so-called exp-log class, has been treated in previous papers. We also provide similar asymptotic estimates for combinatorial objects with a restricted pattern, that is, when part of its factorization patterns is known. We extend our results to include certain type of integers partitions. partitions

• 出版日期2010