Restrictive patterns of combinatorial structures via comparative analysis

DOI10.1007/s00026-015-0275-8zbMath1327.05020OpenAlexW634854667MaRDI QIDQ893896

Eugenijus Manstavicius

Publication date: 20 November 2015

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

Full work available at URL: https://doi.org/10.1007/s00026-015-0275-8

zbMATH Keywords

generating functionrestricted patternlabeled decomposable structuresTauber theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (1)

Variance of additive functions defined on random assemblies

Cites Work

• Unnamed Item
• Unnamed Item
• Voronoi summation formulae and multiplicative functions on permutations
• Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures
• Enumeration of decomposable combinatorial structures with restricted patterns
• Total variation approximation for random assemblies and a functional limit theorem
• Spatial random permutations with small cycle weights
• An analytic method in probabilistic combinatorics
• Logarithmic combinatorial structures: A probabilistic approach
• The sampling theory of selectively neutral alleles
• Cycle structure of random permutations with cycle weights
• Singularity Analysis of Generating Functions
• Asymptotic Methods in Enumeration
• Mappings on Decomposable Combinatorial Structures: Analytic Approach
• Couplings for Irregular Combinatorial Assemblies
• A Darboux-type theorem for slowly varying functions

This page was built for publication: Restrictive patterns of combinatorial structures via comparative analysis