相关论文: A study on prefixes of $c_2$ invariants

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 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…

The c_2 invariant, defined by Schnetz in 2011, is an arithmetic graph invariant created towards a better understanding of Feynman integrals. This paper looks at some graph families of interest, with a focus on decompleted toroidal grids.…

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…

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 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 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 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…

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…

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…

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…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.

Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…

We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…

Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…

The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…