Related papers: Bananas: multi-edge graphs and their Feynman integ…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We study the symbolic $F$-splitness of families of binomial edge ideals. We also study the strong $F$-regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The answers for Feynman diagrams satisfy various kinds of differential equations -- which is not a surprise, because they are defined as Gaussian correlators, possessing a vast variety of Ward identities and superintegrability properties.…
This paper is the first part in a series of three papers devoted to the study of enumerative invariants of abelian surfaces through the tropical approach. In this paper, we consider the enumeration of genus $g$ curves of fixed degree…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
We extend the study of banana diagrams in coordinate representation to the case of curved space-times. If the space is harmonic, the Green functions continue to depend on a single variable -- the geodesic distance. But now this dependence…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…
For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
We present a system of canonical differential equations satisfied by the three-loop banana integrals with four distinct non-zero masses in $D = 2-2\eps$ dimensions. Together with the initial condition in the small-mass limit, this provides…
The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a…
Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…
In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…
We develop a diagrammatic perturbation theory to account for the emergence of moir\'e bands in the continuum model of twisted bilayer graphene. Our framework is build upon treating the moir\'e potential as a perturbation that transfers…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…