Related papers: Leading RG logs in $\phi^4$ theory
It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…
In the present work the Riemanns hypothesis (RH) is discussed from four different perspectives. In the first case, coherent states and the Stengers approximation to Riemann-zeta function are used to show that RH avoids an indeterminacy of…
A new powerful method to calculate Feynman diagrams is proposed. It consists in setting up a Taylor series expansion in the external momenta squared (in general multivariable). The Taylor coefficients are obtained from the original diagram…
Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined…
In this paper, we give the first and second fundamental theorems of invariant theory for certain invariant rings whose generators are expressed by circulant determinants.
We present a new algorithm for the reduction of one-loop \emph{tensor} Feynman integrals with $n\leq 4$ external legs to \emph{scalar} Feynman integrals $I_n^D$ with $n=3,4$ legs in $D$ dimensions, where $D=d+2l$ with integer $l \geq 0$ and…
We study several multiscale one-loop five-point families of Feynman integrals. More specifically, we employ the Simplified Differential Equations approach to obtain results in terms of Goncharov polylogarithms of up to transcendental weight…
The 4-th order Runge-Kutta method in the complex plane is proposed for numerically advancing the solutions of a system of first order differential equations in one external invariant satisfied by the master integrals related to a Feynman…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
In this paper, we propose new understandings for recently discovered hidden zeros and novel splittings, by utilizing Feynman diagrams. The study focus on ordered tree level amplitudes of three theories, which are ${\rm Tr}(\phi^3)$,…
We introduce a new class of higgs type complex-valued scalar fields $U$ with Feynman propagator $\sim 1/p^4$ and consider the matching to the traditional fields with propagator $\sim 1/p^2$ in the viewpoint of effective potentials at tree…
This thesis focuses on theoretical and algorithmic tools for determining the numbers of induced subgraphs in strongly regular graphs, SRGs, and on further applications of such numbers. We consider in more detail a restricted class of these…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
We review Buchler and Colangelo's result that leading divergences at any loop order can be calculated using only one-loop calculations and we provide an alternative proof. We then use this method to calculate the leading divergences of and…
We show that some Lorentz components of the Feynman integrals calculated in terms of the light-cone variables may contain end-point singularities which originate from the contribution of the big-circle integral in the complex k_ plane.…
We develop the general formalism for performing perturbative diagrammatic expansions in the lattice theory of quantum gravity. The results help establish a precise correspondence between continuum and lattice quantities, and should be a…
We study the $3$-component $\phi^4$ model on the simple cubic lattice in presence of a cubic perturbation. To this end, we perform Monte Carlo simulations in conjunction with a finite size scaling analysis of the data. The analysis of the…
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…
The K_4-free process starts with the empty graph on n vertices and at each step adds a new edge chosen uniformly at random from all remaining edges that do not complete a copy of K_4. Let G be the random maximal K_4-free graph obtained at…
This paper is a contribution to Vinberg's theory of $\theta$-groups, or in other words, to Invariant Theory of periodically graded semisimple Lie algebras. One of our main tools is Springer's theory of regular elements of finite reflection…