Decomposable combinatorial structures are studied with restricted patterns. We focus on the decomposable structures in the exp-log class. Using the method of analysis of singularities introduced by Flajolet and Odlyzko [5], we provide an estimate for the probability that a decomposable structure of size n has a given restricted pattern. We exemplify with several decomposable structures like permutations and polynomials over finite fields.

Additional Metadata
Keywords Decomposable structures, Exp-log class, Generating functions, Labeled and unlabeled structures, Restricted pattern
Persistent URL dx.doi.org/10.1007/s00026-009-0008-y
Journal Annals of Combinatorics
Citation
Dong, L. (Li), Gao, Z, & Panario, D. (2009). Enumeration of decomposable combinatorial structures with restricted patterns. Annals of Combinatorics, 12(4), 357–372. doi:10.1007/s00026-009-0008-y