Related papers: Decomposition of elliptic multiple zeta values and…
This talk reviews Feynman integrals, which are associated to elliptic curves. The talk will give an introduction into the mathematics behind them, covering the topics of elliptic curves, elliptic integrals, modular forms and the moduli…
In this paper, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by…
We review certain classes of iterated integrals that appear in the computation of Feynman integrals that involve elliptic functions. These functions generalise the well-known class of multiple polylogarithms to elliptic curves and are…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
In the theory of elliptic functions and elliptic curves, the Weierstrass $zeta$ function (which is essentially an antiderivative of the Weierstrass $\wp$ function) plays a prominent role. Although it is not an elliptic function, Eisenstein…
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…
We report on an implementation within GiNaC to evaluate iterated integrals related to elliptic Feynman integrals numerically to arbitrary precision within the region of convergence of the series expansion of the integrand. The…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
We present an algorithm where only the Cholesky basis is determined in the decomposition procedure. This allows for improved screening and a partitioned matrix decomposition scheme, both of which significantly reduce memory usage and…
In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…
Phase space cuts are implemented by inserting Heaviside theta functions in the integrands of momentum-space Feynman integrals. By directly parametrizing theta functions and constructing integration-by-parts (IBP) identities in the…
We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear system of equations derived from the so…
In this paper we define multiple Dedekind zeta values (MDZV), using a new type of iterated integrals, called iterated integrals on a membrane. One should consider MDZV as a number theoretic generalization of Euler's multiple zeta values.…
We introduce the method of desingularization of multi-variable multiple zeta-functions (of the generalized Euler-Zagier type), under the motivation of finding suitable rigorous meaning of the values of multiple zeta-functions at…
The motivic coaction of multiple zeta values and multiple polylogarithms encodes both structural insights on and computational methods for scattering amplitudes in a variety of quantum field theories and in string theory. In this work, we…
The aim of this paper is to analyze from a mathematical perspective some existing schemes to partition a molecular density into several atomic contributions, with a specific focus on Iterative Stockholder Atom (ISA) methods. We provide a…
We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key ingredient is to introduce modified…
We investigate iterated integrals on an elliptic curve, which are a natural genus-one generalization of multiple polylogarithms. These iterated integrals coincide with the multiple elliptic polylogarithms introduced by Brown and Levin when…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…
Consider a hyperelliptic integral $I=\int P/(Q\sqrt{S}) dx$, $P,Q,S\in\mathbb{K}[x]$, with $[\mathbb{K}:\mathbb{Q}]<\infty$. When $S$ is of degree $\leq 4$, such integral can be calculated in terms of elementary functions and elliptic…