Related papers: Summing tree graphs at threshold
We solve the equations of motion of a complex $\phi^4$ theory coupled to some given gauge field background. The solutions are given in both cylindrical and spherical coordinates and have finite energy.
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
This work is the second part of an investigation aiming at the study of optical wave equations from a field-theoretic point of view. Here, we study classical and quantum aspects of scalar fields satisfying the paraxial wave equation. First,…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
This is a preliminary study of the equation of motion of Euclidean classical gravity on a graph, based on the Lin-Lu-Yau Ricci curvature on graphs. We observe that the constant edge weights configuration gives the unique solution on an…
We extend the usual definition of the derivative in a way that Calculus I students can easily comprehend and which allows calculations at branch points.
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
A generic theory of a single real scalar field is considered, and a simple method is presented for obtaining a class of solutions to the equation of motion. These solutions are obtained from a simpler equation of motion that is generated by…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
We define and compute explicitly the classical limit of the realizations of $W_n$ appearing as hamiltonian structures of generalized KdV hierarchies. The classical limit is obtained by taking the commutative limit of the ring of…
We compute two infinite series of tree-level amplitudes with a massive scalar pair and an arbitrary number of gluons. We provide results for amplitudes where all gluons have identical helicity, and amplitudes with one gluon of opposite…
We give a detailed derivation of the Boltzmann equation, and in particular its collision integral, in classical field theory. We first carry this out in a scalar theory with both cubic and quartic interactions and subsequently in a…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
In this paper, we mainly show that Euler sums of generalized hyperharmonic numbers can be expressed in terms of linear combinations of the classical Euler sums.
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and…