Add to ORKGIn 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 find exact formulas for the moments of the distribution of number of components and number of crossings
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
Abstract. Using methods from Analytic Combinatorics, we study the families of perfect matchings, par...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
AbstractWe present some combinatorial results in counting various kinds of s.c. chord diagrams. Latt...
AbstractWe present some combinatorial results in counting various kinds of s.c. chord diagrams. Latt...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
Abstract. Using methods from Analytic Combinatorics, we study the families of perfect matchings, par...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
AbstractWe present some combinatorial results in counting various kinds of s.c. chord diagrams. Latt...
AbstractWe present some combinatorial results in counting various kinds of s.c. chord diagrams. Latt...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
International audienceUsing methods from Analytic Combinatorics, we study the families of perfect ma...
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, c...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and orie...