Related papers: On the Feynman Graph Integrals on Elliptic Curves
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
We describe algorithms based on invariant theory to solve problems on the geometry of curves, mainly those of genus 2, 3 and 4. New theoretical results building on the first author's PhD thesis are also included.
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
We study the convexity of the entropy functional along particular interpolating curves defined on the space of finitely supported probability measures on a graph.
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
In this paper we study the affine geometric structure of the graph of a polynomial $f \in \mathbb{R} [x,y]$. We provide certain criteria to determine when the parabolic curve is compact and when the unbounded component of its complement is…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We show that counting functions of covers of $\mathbb{C}^\times$ are equal to sums of integrals associated to certain `Feynman' graphs. This is an analogue of the mirror symmetry for elliptic curves by Dijkgraaf.
We summarize the Hopf algebra structure on Feynman diagrams and emphasize the interest in further algebraic structures hidden in Feynman graphs.
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with graphs and relational…
We invent an automated method for computing the divergent part of Feynman integrals in dimensional regularization. Our method exploits simplifications from four-dimensional integration-by-parts identities. Leveraging algorithms from the…
We use fine curve graph tools to prove that there exist parabolic isometries of graphs of curves associated to surfaces of infinite type.
L-infinity morphisms are studied from the point of view of perturbative quantum field theory, as generalizations of Feynman expansions. The connection with the Hopf algebra approach to renormalization is exploited. Using the coalgebra…
We describe how to construct and compute unambiguously path integrals for particles moving in a curved space, and how these path integrals can be used to calculate Feynman graphs and effective actions for various quantum field theories with…
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…