On a class of linked diagrams. I: Enumeration
From MaRDI portal
Publication:1252855
DOI10.1016/0097-3165(78)90065-1zbMath0395.05002OpenAlexW2042966012MaRDI QIDQ1252855
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90065-1
enumerationcombinatorial structuresclass of linked diagramscomplete pairingtotal number of distinct arrangements
Exact enumeration problems, generating functions (05A15) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Asymptotic enumeration (05A16)
Related Items
Bell numbers, their relatives, and algebraic differential equations, Non-perturbative completion of Hopf-algebraic Dyson-Schwinger equations, Linear trees and RNA secondary structure, A quadratic recurrence of Faltung type, The enumeration of connected graphs and linked diagrams, RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties, Approximating sparse graphs: The random overlapping communities model, Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings, Partitions and partial matchings avoiding neighbor patterns, The normal distribution is \(\boxplus\)-infinitely divisible, A semi-bijective algorithm for saturated extended 2-regular simple stacks, The combinatorics of a tree-like functional equation for connected chord diagrams, Analytic solution of Hedin’s equations in zero dimensions, Four-regular graphs with rigid vertices associated to DNA recombination, Chords, trees and permutations, Connected chord diagrams and bridgeless maps, On a class of linked diagrams. II: Asymptotics, Wilson loops in terms of color invariants, Combinatorics of RNA secondary structures, General combinatorics of RNA secondary structure, Symbol Separation in Double Occurrence Words, Free cumulants and enumeration of connected partitions, The enumeration of irreducible combinatorial objects
Cites Work
