Related papers: Algorithms and tools for iterated Eisenstein integ…
A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.
Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric…
The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of…
We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We embed Feynman integrals in the subvarieties of Grassmannians through homogenization of the integrands in projective space, then obtain GKZ-systems satisfied by those scalar integrals. The Feynman integral can be written as linear…
The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…
The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
General one-loop integrals with arbitrary mass and kinematical parameters in $d$-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects $(n+1)$-point to $n$-point functions. In…
Higher orders in perturbation theory require the calculation of Feynman integrals at multiple loops. We report on an approach to systematically solve Feynman integrals by means of symbolic summation and discuss the underlying algorithms.…
We highlight the latest developments in computing higher-order scattering amplitudes with massive internal propagators. The contributing Feynman integrals often lead to special classes of functions, for example, functions associated with…
A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening…
In this paper we propose an algorithm for the formation of matrices of isogeometric Galerkin methods. The algorithm is based on three ideas. The first is that we perform the external loop over the rows of the matrix. The second is that we…