Enumeration of decomposable combinatorial structures with restricted patterns

DOI10.1007/s00026-009-0008-yzbMath1229.05028OpenAlexW1993054401MaRDI QIDQ659766

Daniel Panario, Li Dong, Zhi-Cheng Gao

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0008-y

zbMATH Keywords

generating functionsdecomposable structuresexp-log classlabeled and unlabeled structuresrestricted pattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Related Items

On the enumeration of polynomials with prescribed factorization pattern, Restrictive patterns of combinatorial structures via comparative analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian limiting distributions for the number of components in combinatorial structures
• Automatic average-case analysis of algorithms
• Largest component in random combinatorial structures
• Smallest components in decomposable structures: Exp-log class
• The index calculus method using non-smooth polynomials
• The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
• Singularity Analysis of Generating Functions
• Théorèmes de densité dans $F_q[X$]
• Analysis of Ben-Or's polynomial irreducibility test
• Polynomials over finite fields free from large and small degree irreducible factors
• Distinct Degree Factorizations for Polynomials over a Finite Field
• On the field of combinatory analysis
• Ordered Cycle Lengths in a Random Permutation