Enumeration of decomposable combinatorial structures with restricted patterns

DOI10.1007/S00026-009-0008-YMaRDI QIDQ659766zbMATHOpenAlexFDO

Authors Li Dong, Daniel Panario, Zhicheng 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)

Recommendations

• scientific article; zbMATH DE number 5763331
• Asymptotics of smallest component sizes in decomposable structures of alg-log type
• Limits of logarithmic combinatorial structures.
• Smallest components in decomposable structures: Exp-log class
• Order statistics for decomposable combinatorial structures

Cites work

• scientific article; zbMATH DE number 5763331 (Why is no real title available?)
• scientific article; zbMATH DE number 3956969 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1234413 (Why is no real title available?)
• scientific article; zbMATH DE number 949396 (Why is no real title available?)
• scientific article; zbMATH DE number 874215 (Why is no real title available?)
• scientific article; zbMATH DE number 3104489 (Why is no real title available?)
• Analysis of Ben-Or's polynomial irreducibility test
• Automatic average-case analysis of algorithms
• Distinct Degree Factorizations for Polynomials over a Finite Field
• Gaussian limiting distributions for the number of components in combinatorial structures
• Largest component in random combinatorial structures
• On the field of combinatory analysis
• Ordered Cycle Lengths in a Random Permutation
• Polynomials over finite fields free from large and small degree irreducible factors
• Singularity Analysis of Generating Functions
• Smallest components in decomposable structures: Exp-log class
• The complete analysis of a polynomial factorization algorithm over finite fields
• The index calculus method using non-smooth polynomials
• Théorèmes de densité dans $F_q[X]$

Cited in

(7)

• Enumeration schemes for vincular patterns
• scientific article; zbMATH DE number 5763331 (Why is no real title available?)
• On the enumeration of polynomials with prescribed factorization pattern
• Restrictive patterns of combinatorial structures via comparative analysis
• Enumeration of strong dichotomy patterns
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Order statistics for decomposable combinatorial structures

This page was built for publication: Enumeration of decomposable combinatorial structures with restricted patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659766)