of Chord Diagrams
نویسندگان
چکیده
In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings. Abstract In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings.
منابع مشابه
Analytic Combinatorics of Chord Diagrams Analytic Combinatorics of Chord Diagrams Combinatoire Analytique Des Diagrammes De Cordes Analytic Combinatorics of Chord Diagrams
In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings. Key-words: Analytic combinatorics, c...
متن کاملOn a Basis for the Framed Link Vector Space Spanned by Chord Diagrams
In view of the result of Kontsevich, [5] now often called “the fundamental theorem of Vassiliev theory”, identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear span of chord diagrams modulo the “4T-relation” (and in the unframed case, originally considered in [7], [5], and [1], the “1T-” or “isolated chord relati...
متن کاملChord Diagrams and Gauss Codes for Graphs
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of pl...
متن کاملConnection matrices and Lie algebra weight systems for multiloop chord diagrams
We give necessary and sufficient conditions for a weight system on multiloop chord diagrams to be obtainable from a metrized Lie algebra representation, in terms of a bound on the ranks of associated connection matrices. Here a multiloop chord diagram is a graph with directed and undirected edges so that at each vertex, precisely one directed edge is entering and precisely one directed edge is ...
متن کاملLinear Chord Diagrams with Long Chords
A linear chord diagram of size n is a partition of the set {1, 2, . . . , 2n} into sets of size two, called chords. From a table showing the number of linear chord diagrams of degree n such that every chord has length at least k, we observe that if we proceed far enough along the diagonals, they are given by a geometric sequence. We prove that this holds for all diagonals, and identify when the...
متن کاملEnumeration of Chord Diagrams without Loops and Parallel Chords
We enumerate chord diagrams without loops and without both loops and parallel chords. For labelled diagrams we obtain generating functions, for unlabelled ones we derive recurrence relations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000