Related papers: Graph Reconstruction, Functorial Feynman Rules and…

In this paper we formulate and prove a combinatorial version of the section conjecture for finite groups acting on finite graphs. We apply this result to the study of rational points and show that finite descent is the only obstruction to…

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…

This thesis examines the correspondence between models of statistical physics and Feynman graphs of quantum field theories (QFTs) by a common property: integrability. We review integrable structures for periodic boundary conditions on both…

To unify the quantum electrodynamics (QED) under the first principle which brings the renormalization unartificially, we study Feynman diagrams in QED according to the set theory and the category theory. We add the restriction on the…

Many inference tasks on knowledge graphs, including relation prediction, operate on knowledge graph embeddings -- vector representations of the vertices (entities) and edges (relations) that preserve task-relevant structure encoded within…

One of the main open problems of mathematical physics is to consistently quantize Yang-Mills gauge theory. If such a consistent quantization were to exist, it is reasonable to expect a ``Wightman reconstruction theorem,'' by which a Hilbert…

This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…

We establish a new criterion for a bigraph to have a subgraph with prescribed degree conditions. We show that the bigraph $G[X,Y]$ has a spanning subgraph $F$ such that $g(x)\leq deg_F(x) \leq f(x)$ for $x\in X$ and $deg_F(y) \leq f(y)$ for…

Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…

For any given sequence of integers there exists a quantum field theory whose Feynman rules produce that sequence. An example is illustrated for the Stirling numbers. The method employed here offers a new direction in combinatorics and graph…

I introduce a formalism for representing the syntax of recursively structured graph-like patterns. It does not use production rules, like a conventional graph grammar, but represents the syntactic structure in a more direct and declarative…

Graph kernels are often used in bioinformatics and network applications to measure the similarity between graphs; therefore, they may be used to construct efficient graph classifiers. Many graph kernels have been developed thus far, but to…

Assumption-Based Argumentation (ABA) is a powerful structured argumentation formalism, but exact computation of extensions under stable semantics is intractable for large frameworks. We present the first Graph Neural Network (GNN) approach…

We introduce some generalized topological concepts to deal with union-closed families, and show that one can reduce the proof of Frankl's conjecture to some families of so-called supratopological spaces. We prove some results on the…

The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a theoretical framework able to compare the expressive power…

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…

We prove the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds with residually finite fundamental groups. In real dimension three, where a result of Hempel ensures that the fundamental group…

I describe a mathematical framework for the efficient processing of the very large sets of Feynman diagrams contributing to the scattering of many particles. I reexpress the established numerical methods for the recursive construction of…