Related papers: Summing tree graphs at threshold
We present an amplitude-generating formula in renormalizable quantum field theory. It reflects the self-similarity of loop amplitudes, in which an amplitude can also be a subamplitude of another. Amplitudes are generated by a small number…
In this survey article we present difference field algorithms for symbolic summation. Special emphasize is put on new aspects in how the summation problems are rephrased in terms of difference fields, how the problems are solved there, and…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are…
We show that accordiohedra furnish polytopes which encode amplitudes for all massive scalar field theories with generic interactions. This is done by deriving integral formulae for the Feynman diagrams at tree level and integrands at one…
A multigraph is a nonsimple graph which is permitted to have multiple edges, that is, edges that have the same end nodes. We introduce the concept of spanning simplicial complexes $\Delta_s(\mathcal{G})$ of multigraphs $\mathcal{G}$, which…
Let G = G(V,E) be a graph with | V | vertices and | E | edges and total graph, T(G) is obtained from G. In This paper we have study the Harmonic index of total graph for standards graphs, bipartite graph of particular type, regular graph,…
The classical differential cross-section is calculated for high-energy small-angle gravitational scattering in the factorizable model with toroidal extra dimensions. The three main features of the classical computation are: (a) It involves…
We prove that the topological recursion formalism can be used to quantize any generic classical spectral curve with smooth ramification points and simply ramified away from poles. For this purpose, we build both the associated quantum…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
We derive the classical transport equation, in scalar field theory with a V(phi) interaction, from the equation of motion for the quantum field. We obtain a very simple, but iterative, expression for the effective action which generates all…
Pairwise Compatibility Graphs (PCGs) form a tree-metric graph class that originated in phylogeny and has since attracted sustained interest in graph theory. Several natural generalizations have been proposed in order to overcome the…
Given a connected graph $R$ on $r$ vertices and a rooted graph $H,$ let $R\{H\}$ be the graph obtained from $r$ copies of $H$ and the graph $R$ by identifying the root of the $i-th$ copy of $H$ with the $i-th$ vertex of $R$. Let…
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…
Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…
This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…
The Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the…
As it is well-known, Poisson brackets play a fundamental role both in mechanics and in classical field theories. In this paper we develop a theory of extensions of graded Poisson brackets in graded Dirac manifolds. We then show how these…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
The notion of translation (shift) is straightforward in classical signal processing, however, it is challenging on an irregular graph structure. In this work, we present an approach to characterize the translation operator in various signal…