Related papers: Summing tree graphs at threshold

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

We give a comprehensive review of recent developments on using the pure spinor formalism to compute massless superstring scattering amplitudes at tree level. The main results of the pure spinor computations are placed into the context of…

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.

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…

An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…

Improving upon the previous treatment by Mueller and Son, we derive the Boltzmann equation that results from a classical scalar field theory. This is obtained by starting from the corresponding quantum field theory and taking the classical…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…

A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

A solution of the Einstein vacuum field equations is constructed within the contex of perturbation theory. The solution possesses a graphical representation in terms of diagrams.

We show that the problem of unifying electromagnetism with gravity has an elegant solution in classical physics through the phenomenon of induction. By studying the way that induction leads to the formation of electromagnetic fields, we…

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation}…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

We give an expression for the solution to propagator-type Dyson-Schwinger equations with one primitive at 1 loop as an expansion over rooted connected chord diagrams. Along the way we give a refinement of a classical recurrence of rooted…

By explicitly allowing for topology to change as a function of time, two-dimensional quantum gravity defined through causal dynamical triangulations gives rise to a new continuum string field theory. Within a matrix-model formulation we…

We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…

We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…

We compute the treewidth of a family of graphs we refer to as the glued grids, consisting of the stacked prism graphs and the toroidal grids. Our main technique is constructing strict brambles of large orders. We discuss connections to…