On the number of chord diagrams

DOI10.1016/S0012-365X(99)00347-7zbMATH Open0953.57006OpenAlexW1999890248MaRDI QIDQ1978157FDOQ1978157

Authors: Alexander Stoimenow 

Publication date: 23 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00347-7

Recommendations

• Linear chord diagrams with long chords
• scientific article; zbMATH DE number 1226995
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Linearized chord diagrams and an upper bound for vassiliev invariants

zbMATH Keywords

Vassiliev invariants

Mathematics Subject Classification ID

Cited In (16)

• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Analytic solution of Hedin’s equations in zero dimensions
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Connected chord diagrams and bridgeless maps
• Counting unlabelled chord diagrams of maximal genus
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Bell numbers, their relatives, and algebraic differential equations
• Topology of functions with isolated critical points on the boundary of a 2-dimensional manifold
• Handshakes across a (round) table
• A few weight systems arising from intersection graphs
• A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
• A chord graph constructed from a ribbon surface-link
• Functions with isolated critical points on the boundary of a nonoriented surface
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mapping class group orbits of curves with self-intersections

This page was built for publication: On the number of chord diagrams

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