Related papers: The boundary length and point spectrum enumeration…
In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum,…
It is well known that under a BCFW-deformation, there is a boundary contribution when the amplitude scales as O(1) or worse. We show that boundary contributions have a similar recursion relation as scattering amplitude. Just like the BCFW…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
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…
The boundary contribution of an amplitude in the BCFW recursion relation can be considered as a form factor involving boundary operator and unshifted particles. At the tree-level, we show that by suitable construction of Lagrangian, one can…
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…
Spectral graph theory is well known and widely used in computer vision. In this paper, we analyze image segmentation algorithms that are based on spectral graph theory, e.g., normalized cut, and show that there is a natural connection…
In this paper, we propose a new algorithm to systematically determine the missing boundary contributions, when one uses the BCFW on-shell recursion relation to calculate tree amplitudes for general quantum field theories. After an…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial…
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…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint…
We derive a boundary monotonicity formula for a class of biharmonic maps with Dirichlet boundary conditions. A monotonicity formula is crucial in the theory of partial regularity in super-critical dimensions. As a consequence of such a…
We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…