Related papers: Summing tree graphs at threshold
In Quantum Field Theory, scattering amplitudes are computed from propagators which, for internal lines, are built upon spin/polarization-sum relationships. In turn, these are normally constructed upon plane-wave solutions of the free field…
A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…
In this article we consider several probabilistic processes defining random grapha. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each of the probabilistic processes, we…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
The confinement mechanism proposed earlier and then applied successfully to meson spectroscopy by one of the authors is interpreted in classical terms. For this aim the unique solution of the Maxwell equations, an analog of the…
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem. We describe an approach for computing graph…
A fairly general expression for a light beam is found as a solution of the paraxial Helmholtz equation. It is achieved by exploiting appropriately chosen complex variables which entail the separability of the equation. Next, the expression…
Scattering equations for tree-level amplitudes are viewed in the context of string theory. As a result of the comparison we are led to define a new dual model which coincides with string theory in both the small and large $\alpha'$ limit,…
The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…
Among all trees on $n$ vertices with a given degree sequence, how do we maximise or minimise the sum over all adjacent pairs of vertices $x$ and $y$ of $f(\mathrm{deg} x, \mathrm{deg} y)$? Here $f$ is a fixed symmetric function satisfying a…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.
The nullity of a graph is the multiplicity of the eigenvalue zero in its adjacency spectrum. In this paper, we give a closed formula for the minimum and maximum nullity among trees with the same degree sequence, using the notion of matching…
We consider the coupling of quantum fields to classical gravity in the formalism of ensembles on configuration space, a model that allows a consistent formulation of interacting classical and quantum systems. Explicit calculations show that…