Related papers: Intersection theory rules symbology
We continue our investigation into the insertion-elimination Lie algebra of Feynman graphs in the ladder case, emphasizing the structure of this Lie algebra relevant for future applications in the study of Dyson-Schwinger equations. We work…
Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…
We present a new method for numerically computing generic multi-loop Feynman integrals. The method relies on an iterative application of Feynman's trick for combining two propagators. Each application of Feynman's trick introduces a…
A comprehensive study is performed of two-loop Feynman diagrams with three external legs which, due to the exchange of massless gauge-bosons, give raise to infrared and collinear divergencies. Their relevance in assembling realistic…
A detailed investigation is presented of a set of algorithms which form the basis for a fast and reliable numerical integration of one-loop multi-leg (up to six) Feynman diagrams, with special attention to the behavior around (possibly)…
In this paper, we develop an iterative sector-level reduction strategy for Feynman integrals, which bases on module intersection in the Baikov representation and auxiliary vector for tensor structure. Using this strategy we have studied the…
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms,…
In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
Recently we developed a diagonal homotopy method to compute a numerical representation of all positive dimensional components in the intersection of two irreducible algebraic sets. In this paper, we rewrite this diagonal homotopy in…
A cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its…
We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…
We observe that the characteristic cycle of a D-module gives bounds for decomposition numbers of intersection cohomology complexes.
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…
We propose a new formula to compute Witten--Kontsevich intersection numbers. It is a closed formula, not involving recursion neither solving equations. It only involves sums over partitions of products of factorials, double factorials and…
The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing…
The method of using Hopf algebras for calculating Feynman integrals developed by Abreu et al. is applied to the two-loop non-planar on-shell diagram with massless propagators and three external mass scales. We show that the existence of the…
We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…
We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…