Related papers: Enumeration of linear chord diagrams

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…

In this paper we compute the bivariate generating function of $\gamma$-matchings over two backbones, filtered by the number of arcs and the topological genus. $\gamma$-matchings over two backbones are chord-diagrams, obtained via…

We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an…

Let $C$ be a trigonal curve of genus $g\ge 5$ and let $T$ be the unique trigonal line bundle inducing a map $\pi: C \stackrel{3:1}{\longrightarrow} \mathbb{P}^1$. This note provides a short and easy proof of the normal generation for the…

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…

In this note we obtain numerous new bases for the algebra of symmetric functions whose generators are chromatic symmetric functions. More precisely, if $\{ G_ k \}_{k\geq 1}$ is a set of connected graphs such that $G_k$ has $k$ vertices for…

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…

We prove that the linearization of a germ of holomorphic map of the type $F_\lambda(z)=\lambda(z+O(z^2))$ has a $ C^1$--holomorphic dependence on the multiplier $\lambda$. $C^1$--holomorphic functions are $ C^1$--Whitney smooth functions,…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

We shall consider the product of complex random matrices from the independent complex Ginibre ensembles. The product includes complex matrices $Z_i, Z_i^\dagger, \, i = 1, \ldots, n$ and $2n$ sources (complex matrices $C_i$ and $C_i^*$).…

Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…