Related papers: Proving relations between modular graph functions
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We study several quantities associated to the Green's function of a multiply connected domain in the complex plane. Among them are some intrinsic properties such as geodesics, curvature, and $L^2$-cohomology of the capacity metric and…
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show…
We investigate recursive relations for the Grothendieck classes of the affine graph hypersurface complements of melonic graphs. We compute these classes explicitly for several families of melonic graphs, focusing on the case of graphs with…
The author introduced models of linear logic known as ''Interaction Graphs'' which generalise Girard's various geometry of interaction constructions. In this work, we establish how these models essentially rely on a deep connection between…
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…
Higher Green functions are real-valued functions of two variables on the upper half plane which are bi-invariant under the action of a congruence subgroup, have logarithmic singularity along the diagonal, but instead of the usual equation…
Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…
In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
We consider the connectivity of fiber graphs with respect to Gr\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\"obner basis and prove that their edge-connectivity is lowest possible…
We calculate the Green functions for a scalar field theory with quartic interactions for which the fields are multiplied with a generic translation invariant star product. Our analysis involves both noncommutative products, for which there…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
Let $G$ be a simple graph of order $n$ with degree sequence $(d)=(d_1,d_2,\ldots,d_n)$ and conjugate degree sequence $(d^*)=(d_1^*,d_2^*,\ldots,d_n^*)$. In \cite{AkbariGhorbaniKoolenObudi2010,DasMojallalGutman2017} it was proven that…
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
The generating functional for Green functions of quark currents is given in closed form to next-to-leading order in the low-energy expansion for chiral SU(3), including one-loop amplitudes with up to three meson propagators. Matrix elements…
Graphs are widely used to represent complex information and signal domains with irregular support. Typically, the underlying graph topology is unknown and must be estimated from the available data. Common approaches assume pairwise node…
In this PhD thesis we study holomorphic and non-holomorphic elliptic analogues of multiple zeta values, namely elliptic multiple zeta values and modular graph functions. Both classes of functions have been discovered very recently, and are…
The non-renormalization theorems of chiral vertex functions are derived on the basis of an algebraic analysis. The property, that the interaction vertex is a second supersymmetry variation of a lower dimensional field monomial, is used to…