Related papers: On the Feynman Graph Integrals on Elliptic Curves
In this talk, we discuss recent progress in the application of generalizations of polylogarithms in the symbolic computation of multi-loop integrals. We briefly review the Maple program MPL which supports a certain approach for the…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
We seek solutions $u\in\R^n$ to the semilinear elliptic partial difference equation $-Lu + f_s(u) = 0$, where $L$ is the matrix corresponding to the Laplacian operator on a graph $G$ and $f_s$ is a one-parameter family of nonlinear…
In this report, we describe a novel graph invariant for computational graphs (colored directed acylic graphs) and how we used it to generate all distinct computational graphs up to isomorphism for small graphs. The algorithm iteratively…
We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…
Feynman integrals that have been evaluated in dimensional regularization can be written in terms of generalized hypergeometric functions. It is well known that properties of these functions are revealed in the framework of intersection…
We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
We present a method to accelerate the numerical evaluation of spatial integrals of Feynman diagrams when expressed on the real frequency axis. This can be realized through use of a renormalized perturbation expansion with a constant but…
In this paper, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper…
We give an explicit calculation of the Wu invariants for immersions of a finite graph into the plane and classify all generic immersions of a graph into the plane up to regular homotopy by the Wu invariant. This result is a generalization…