Related papers: Enumeration of linear chord diagrams
We compute the generator rank of a subhomgeneous C*-algebra in terms of the covering dimension of the pieces of its primitive ideal space corresponding to irreducible representations of a fixed dimension. We deduce that every Z-stable…
By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.
A filoop is a generic immersion of a circle in a closed oriented surface, whose complement is a disjoint union of discs, considered up to orientation preserving diffeomorphisms. It gives rise to a chord diagram C which has an interlace…
Let $B$ be an induced complete bipartite subgraph of $G$ on vertex sets of bipartition $B_{X}$ and $B_{Y}$. The subgraph $B$ is {\it generating} if there exists an independent set $S$ such that each of $S \cup B_{X}$ and $S \cup B_{Y}$ is a…
We advertise elementary symmetric polynomials $e_i$ as the natural basis for generating series $A_{g,n}$ of intersection numbers of genus g and n marked points. Closed formulae for $A_{g,n}$ are known for genera $0$ and $1$ -- this approach…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
Graphs are increasingly becoming ubiquitous as models for structured data. A generative model that closely mimics the structural properties of a given set of graphs has utility in a variety of domains. Much of the existing work require that…
In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…
A \textit{$k$-total coloring} of a graph $G$ is an assignment of $k$ colors to its elements (vertices and edges) so that adjacent or incident elements have different colors. The total chromatic number is the smallest integer $k$ for which…
Let $\mathcal{C} \subset \mathbb{P}^r$ be a linearly normal curve of arithmetic genus $g$ and degree $d$. In \cite{SD}, B. Saint-Donat proved that the homogeneous ideal $I(\mathcal{C})$ of $\mathcal{C}$ is generated by quadratic equations…
We show that the $n$-point, genus-$g$ correlation functions of topological recursion on any regular spectral curve with simple ramifications grow at most like $(2g - 2 + n)!$ as $g \rightarrow \infty$, which is the expected growth rate.…
Let G be a chordal graph, X(G) the complement of the associated complex arrangement and Gamma(G) the fundamental group of X(G). We show that Gamma(G) is a limit of colored braid groups over the poset of simplices of G. When G = G_T is the…
Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…
We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of…
A chord of a cycle $C$ is an edge joining two non-consecutive vertices of $C$. A cycle $C$ in a graph $G$ is chorded if the vertex set of $C$ induces at least one chord. In this paper, we prove that if $G$ is a graph with order $n\geq 6$…
In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…
Edge-girth-regular graphs (abbreviated as $egr$ graphs) are a class of highly regular graphs. More specifically, for integers $v$, $k$, $g$ and $\lambda$ an $egr(v,k,g,\lambda)$ graph is a $k$-regular graph with girth $g$ on $v$ vertices…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…