Restrictive patterns of combinatorial structures via comparative analysis

DOI10.1007/S00026-015-0275-8MaRDI QIDQ893896zbMATH OpenOpenAlexFDO

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

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

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)