Related papers: c_2 Invariants of Recursive Families of Graphs

The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…

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…

The $c_2$-invariant is an arithmetic graph invariant useful for understanding Feynman periods. Brown and Schnetz conjectured that the $c_2$-invariant has a particular symmetry known as completion invariance. This paper will prove completion…

The c_2 invariant of a Feynman graph is an arithmetic invariant which detects many properties of the corresponding Feynman integral. In this paper, we define the c_2 invariant in momentum space and prove that it equals the c_2 invariant in…

This document begins by reviewing recent progress that has been made by taking a combinatorial perspective on the $c_2$ invariant, an arithmetic graph invariant with connections to Feynman integrals. Then it proceeds to report on some…

The $c_2$ invariant is an arithmetic graph invariant related to quantum field theory. We give a relation modulo $p$ between the $c_2$ invariant at $p$ and the $c_2$ invariant at $p^s$ by proving a relation modulo $p$ between certain…

The $c_2$ invariants in all 4 different representations of the Feynman period (parametric and dual parametric representations, position and momentum spaces) coincide for all log-divergent graphs that satisfy the combinatorial condition…

A Feynman period is a particular residue of a scalar Feynman integral which is both physically and number theoretically interesting. Two ways in which the graph theory of the underlying Feynman graph can illuminate the Feynman period are…

The obstruction for application of effective techniques like denominator reduction for the computation of the $c_2$ invariant of Feynman graphs in general is the absence of a 3-valent vertex for the initial steps. In this paper such a…

In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…

For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. This sequence counts spanning tree partitions and constitutes the diagonal coefficients of powers of the Kirchhoff polynomial. We prove…

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…

The Gromov-Witten theory of Deligne-Mumford stacks is a recent development, and hardly any computations have been done beyond 3-point genus 0 invariants. This paper provides explicit recursions which, together with some invariants computed…

We define a $\mathbb{Z}_2$-valued invariant for transversely-intersecting coassociative $4$-folds equipped with spin structures. Our main result shows this invariant provides an obstruction to separating two such coassociatives through a…

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

For two-parameter families of dissipative twist maps, we investigate the dynamics of invariant graphs as well as the thresholds for their existence and breakdown. Our main results are as follows: (1) For arbitrarily small $C^r$…

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

We introduce families of four-regular graphs consisting of chains of hourglasses which are attached to a finite kernel. We prove a formula for the $c_2$ invariant of these hourglass chains which only depends on the kernel. For different…

We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…

We define a complete invariant for doodles on a 2-sphere which takes values in series of chord diagrams of certain type. The coefficients at the diagrams with $n$ chords are finite type invariants of doodles of order at most $2n$.