Rooted connected chord diagrams form a nice class of combinatorial objects. Recently they were shown to index solutions to certain Dyson-Schwinger equations in quantum field theory. Key to this indexing role are certain special chords which are called terminal chords. Terminal chords provide a number of combinatorially interesting parameters on rooted connected chord diagrams which have not been studied previously. Understanding these parameters better has implications for quantum field theory.
Specifically, we show that the distributions of the number of terminal chords and the number of adjacent terminal chords are asymptotically Gaussian with logarithmic means, and we prove that the average index of the first terminal chord is $2n/3$. Furthermore, we obtain a method to determine any next-to${}^i$ leading log expansion of the solution to these Dyson-Schwinger equations, and have asymptotic information about the coefficients of the log expansions.
We derive a functional relation between the generating functions of connected chord diagrams and 2-connected chord diagrams. This relation enables us to calculate an asymptotic expansion for the number of 2-connected chord diagrams on $n$ chords. The asymptotic information obtained from this expansion refines the last established results and provides a simple alternative for calculating the asymptotic behaviour of certain Green functions in Quenched QED and Yukawa theory in the context of quantum field theory.
In this article we study an asymptotic expansion for $C_n$, the number of connected chord diagrams on $n$ chords. The expansion is obtained in earlier work by means of alien derivatives applied to the generating series of connected chord diagrams; we seek a combinatorial interpretation. The main outcome presented here is a new combinatorial interpretation for entry https://oeis.org/A088221 of the OEIS. We will show that https://oeis.org/A088221 counts pairs of connected chord diagrams (allowing empty diagrams). This gives a combinatorial interpretation for the part of the closed form of the as…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating functions of two different subsets of weighted connected chord diagrams: arbitrary diagrams and diagrams forbidding so-called top cycle subdiagrams. These equations generalize the classic specification for increasing ordered trees and their solution uses a novel decomposition, simplifying and generalizing previous results. The resulting tree perspective on chord…
Series solutions for a large family of single equation Dyson-Schwinger equations are given as expansions over decorated rooted connected chord diagrams. The analytic input to the new expansions are the expansions of the regularized integrals for the primitive graphs building the Dyson-Schwinger equation. Each decorated chord diagram contributes a weighted monomial in the coefficients of the expansions of the primitives and so indexes the analytic solution in a tightly controlled way.
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two classes, which naturally extends to indecomposable diagrams and general rooted maps. As an application, this bijection provides a simplifying framework for some technical quantum field theory work realized by some of the authors. Most notably, an important but technical parameter naturally translates to vertices at the level of maps. We also give a combinatorial…
We generalize the notion of linear chord diagrams to the case of matched sets of size $k$, which we call $k$-chord diagrams. We provide formal generating functions and recurrence relations enumerating these $k$-chord diagrams by the number of short chords, where the latter is defined as all members of the matched set being adjacent, and is the generalization of a short chord or loop in a linear chord diagram. We also enumerate $k$-chord diagrams by the number of connected components built from short chords and provide the associated generating functions in this case. We show that the distribut…
We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically 4-edge-connected planar cubic graph, except $K_2^3$ and $K_4$, is contained in a perfect matching whose removal disconnects the graph. We obtain a complete characterization of 2-edge-connected planar cubic graphs that have an edge such that every 2-factor containing the edge is a Hamiltonian cycle, and also of those that have an edge such that the complement of eve…
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variants of finding connected vertex covers of minimum size or weight are well studied, surprisingly there is no work on the enumeration or maximum number of minimal connected vertex covers of a graph. In this paper we show that the maximum number of minimal connected vertex covers of a graph is at most 1.8668^n, and these can be enumerated in time O(1.8668^n). For graphs of chordality at most 5, we are able to give a bette…
In the special case of graphs G of independence number a(G)=3 without induced chordless cycles C7 it is shown that exists connected dominating set D of vertices with number of vertices n(D)<=4. Using the concept of connected dominating sets, we defined a new invariant h(G) that does not exceed the number of Hadwiger. For the considered graphs it is shown that h(G)>=n(G)/4.
This thesis addresses a number of enumerative problems that arise in the context of quantum field theory and in the process of renormalization. In particular, the enumeration of rooted connected chord diagrams is further studied and new applications in quenched QED and Yukawa theories are introduced. Chord diagrams appear in quantum field theory in the context of Dyson-Schwinger equations, where, according to recent results, they are used to express the solutions. In another direction, we study the action of point field diffeomorphisms on a free theory. We give a new proof of a vanishing pheno…
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We determine, with an exception of two cases, the complexity of the Disjoint Paths problem for $H$-free graphs. If $k$ is fixed, we obtain the $k$-Disjoint Paths problem, which is known to be polynomial-time solvable on the class of all graphs for every $k \geq 1$. The latter does no longer hold if we need to connect vertices from terminal sets instead of terminal pairs. We completely classify the complexity of $k$-Disjoint …
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the former case, we record in a generating function the number of fatgraph boundary cycles containing a fixed number of bivalent vertices while in the latter, we instead record the number of boundary cycles of each fixed length. Second order, non-linear, algebraic partial differential equations are derived which are satisfied by these generating functions in ea…
Paths $P_1,\ldots, P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices. The Induced Disjoint Paths problem is to decide if a graph $G$ with $k$ pairs of specified vertices $(s_i,t_i)$ contains $k$ mutually induced paths $P_i$ such that each $P_i$ starts from $s_i$ and ends at $t_i$. This is a classical graph problem that is NP-complete even for $k=2$. We introduce a natural generalization, Induced Disjoint Connected Subgraphs: instead of connecting pairs of terminals, we must connect sets of terminals. We give al…
一个简单连通图$G$的洞是一个无弦圈$C_n,$，其中图$G$中的$n \in \Bbb N, n \geq 4,$。一个简单连通图$G$的围长是$G$中的最小圈，如果存在这样的圈的话。可以观察到，所有这些最小的周期必然是无弦的。我们称给定图$G$中的圈$C_3$为该图的本原洞。我们引入了图的本原洞数的概念，作为该图中存在的本原洞的数量。本文确定了某些标准图的本原洞数。另外，我们还确定了一个Jaco图的底层图$J^*_{n+1}(1),$的本原洞数，其中$n \in \Bbb N, n \geq 4$递归地表示底层Jaco图$J_n(1)$，且其顶点为素Jaconian顶点$v_i$ .本文还引入了图的顶点本原度的概念，并确定了某些图的顶点本原度。
