Asymptotics of Smallest Component Sizes in Decomposable Combinatorial Structures of Alg-Log Type
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/r...
Main Authors: | Li Dong, Zhicheng Gao, Daniel Panario, Bruce Richmond |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2010-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/503/pdf |
Similar Items
-
Further results on maximal nontraceable graphs of smallest size
by: Alewyn Petrus Burger, et al.
Published: (2013-02-01) -
The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern
by: Li Dong, et al.
Published: (2007-01-01) -
A Combinatorial Approach to the Tanny Sequence
by: Anita Das
Published: (2011-07-01) -
Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01) -
Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)