Restrictive patterns of combinatorial structures via comparative analysis

DOI10.1007/S00026-015-0275-8zbMATH Open1327.05020OpenAlexW634854667MaRDI QIDQ893896FDOQ893896

Authors: Eugenijus Manstavičius 

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)

Cites Work

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

Cited In (1)

• Constructing patterns of (many) ESSs under support size control

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

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