Related papers: Enumeration of linear chord diagrams
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…
For a pair of natural numbers $k, l$, a $(k,l)$-colouring of a graph $G$ is a partition of the vertex set of $G$ into (possibly empty) sets $S_1, S_2, \dots, S_k$, $C_1, C_2, \dots, C_l$ such that each set $S_i$ is an independent set and…
We classify representations of the mapping class group of a surface of genus $g$ (with at most one puncture or boundary component) up to dimension $3g-3$. Any such representation is the direct sum of a representation in dimension $2g$ or…
A $1$-factor in an $n$-vertex graph $G$ is a collection of $\frac{n}{2}$ vertex-disjoint edges and a $1$-factorization of $G$ is a partition of its edges into edge-disjoint $1$-factors. Clearly, a $1$-factorization of $G$ cannot exist…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
The goal of this paper is to explicitly detect all the arithmetic genera of arithmetically Cohen-Macaulay projective curves with a given degree $d$. It is well-known that the arithmetic genus $g$ of a curve $C$ can be easily deduced from…
The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…
In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal…
We present a program package which generates homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph $\alpha$ is given in the form $W(\alpha)=\prod_{i=1}^N p(q_i)$, where $p(q)$ is an…
The Catalan numbers occur in various counting problems in combinatorics. This paper reveals a connection between the Catalan numbers and list colouring of graphs. Assume $G$ is a graph and $f:V(G) \to N$ is a mapping. For a nonnegative…
Motivated by the question of which structural properties of a graph can be recovered from the chromatic symmetric function (CSF), we study the CSF of connected unicyclic graphs. While it is known that there can be non-isomorphic unicyclic…
Roman Numeral analysis is the important task of identifying chords and their functional context in pieces of tonal music. This paper presents a new approach to automatic Roman Numeral analysis in symbolic music. While existing techniques…
For any root system corresponding to a semisimple simply-laced Lie algebra a logarithmic CFT is constructed. Characters of irreducible representations were calculated in terms of theta functions.
We propose a hierarchical normalizing flow model for generating molecular graphs. The model produces new molecular structures from a single-node graph by recursively splitting every node into two. All operations are invertible and can be…
We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…
Let F be a non-abelian finite rank free group, and let H_g be the fundamental group of a surface of genus g with one boundary component represented by D_g in H_g. So, H_g is the free group <a_1,b_1,...,a_g,b_g> and D_g is the product of…
Andrei et al. have shown in 2000 that the graph $\boldsymbol{\mathrm{C}}$ of the Collatz function starting with root $8$ after the initial loop is an infinite binary tree $\boldsymbol{A}(8)$. According to their result they gave a…