On a class of linked diagrams. II: Asymptotics
From MaRDI portal
Publication:1252856
DOI10.1016/0012-365X(78)90162-0zbMath0395.05003MaRDI QIDQ1252856
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Asymptotic enumeration (05A16)
Related Items
Non-perturbative completion of Hopf-algebraic Dyson-Schwinger equations, Formation of a giant component in the intersection graph of a random chord diagram, On a uniformly random chord diagram and its intersection graph, A quadratic recurrence of Faltung type, RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties, Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow, Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings, The normal distribution is \(\boxplus\)-infinitely divisible, An asymptotic expansion for the number of two-connected chord diagrams, Fast algorithms of bath calculations in simulations of quantum system-bath dynamics, Connected Chord Diagrams and the Combinatorics of Asymptotic Expansions, Analytic solution of Hedin’s equations in zero dimensions, Circular planar electrical networks: posets and positivity, Generating asymptotics for factorially divergent sequences, Generating asymptotics for factorially divergent sequences, On a class of linked diagrams. I: Enumeration, Wilson loops in terms of color invariants, Combinatorics of RNA secondary structures, General combinatorics of RNA secondary structure, Free cumulants and enumeration of connected partitions, Numerical analysis for inchworm Monte Carlo method: Sign problem and error growth
Cites Work
