Related papers: The five-twist identity for Feynman periods
In this paper, we define a graph-theoretic analog for the Riemann tensor and analyze properties of the cyclic symmetry. We have developed a fuzzy graph-theoretic analog of the Riemann tensor and have analyzed its properties. We have also…
Let $\mathcal{M}(n)$ be the subgroup of $GL(n,\mathbb{Z})$ generated by the particular involutions that are identical to the identity, except for a single line where $-1$ and $+1$ alternate. We study the properties of $\mathcal{M}(n)$, and…
A growing body of evidence suggests that the complexity of Feynman integrals is best understood through geometry. Recent mathematical developments [Kontsevich and Soibelman, arXiv:2402.07343] have illuminated the role of exponential…
On a space of stable maps, the psi classes are modified by subtracting certain boundary divisors. The top products of modified psi classes, usual psi classes, and classes pulled back along the evaluation maps are called twisted descendants;…
The $c_2$ invariant is an arithmetic graph invariant defined by Schnetz. It is useful for understanding Feynman periods. Brown and Schnetz conjectured that the $c_2$ invariant has a particular symmetry known as completion invariance. This…
Yoshikawa moves were introduced at least quarter-century ago and are still actively used by researchers. For any marked graph diagram we will define its twisted diagram and its mirror cut surface. By using a surface-link group of a mirror…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…
This paper reviews and generalizes Feynman's path integration methods which use time slicing with straight line segments and Fourier sine series. The generalizations are done from variational calculus considerations and in one dimension for…
Based on the Baikov representation, we present a systematic approach to compute cuts of Feynman Integrals, appropriately defined in $d$ dimensions. The information provided by these computations may be used to determine the class of…
We describe the twisted doubling integrals of Cai-Friedberg-Ginzburg-Kaplan in a conceptual way. This also extends the construction to the quaternionic unitary groups. We carry out the unfolding argument uniformly in this article. To do so,…
In this paper we prove a new upper bouhd on an edge Folkman number. In a previous paper we have proved that this bound is exact.
We describe the "Feynman diagram" approach to nonrelativistic quantum mechanics on R^n, with magnetic and potential terms. In particular, for each classical path \gamma connecting points q_0 and q_1 in time t, we define a formal power…
We study a surprising phenomenon in which Feynman integrals in $D=4-2\varepsilon$ space-time dimensions as $\varepsilon \to 0$ can be fully characterized by their behavior in the opposite limit, $\varepsilon \to \infty$. More concretely, we…
One of the most significant discrete invariants of a quadratic form $\phi$ over a field $k$ is its (full) splitting pattern, a finite sequence of integers which describes the possible isotropy behaviour of $\phi$ under scalar extension to…
We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…
Finite discrete Huffman sequences, together with their extension to n-dimensional arrays, are highly valued because their discrete aperiodic auto-correlations optimally approximate the continuum form of the delta function. We present here…
In this paper we introduce two general identities relating Eisenstein series on split classical groups, as well as double covers of symplectic groups. The first identity can be viewed as an extension of the doubling construction introduced…