Related papers: Identities between Modular Graph Forms
Let $\pi\colon P\to M$ be a principal bundle and $p$ an invariant polynomial of degree r on the Lie algebra of the structure group. The theory of Chern-Simons differential characters is exploited to define an homology map $\chi^{k} :…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
A momentum-space approach to conformal field theory offers a new perspective on cosmological correlators and better reveals the underlying connections to scattering amplitudes. This thesis explores the interplay between integral…
The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…
Elliptic modular graph forms (eMGFs) are non-holomorphic modular forms depending on a modular parameter $\tau$ of a torus and marked points $z$ thereon. Traditionally, eMGFs are constructed from nested lattice sums over the discrete momenta…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…
This paper addresses the semantics of weighted argumentation graphs that are bipolar, i.e. contain both attacks and supports for arguments. It builds on previous work by Amgoud, Ben-Naim et. al. We study the various characteristics of…
We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…
Existing multiplex graph models often assume homophily, where connected nodes tend to belong to the same class or share similar attributes. Consequently, these models may struggle with graphs exhibiting heterophily, where connected nodes…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…