Related papers: Dual Graph Polynomials and a 4-face Formula

The scramble number of a graph provides a lower bound for gonality and an upper bound for treewidth, making it a graph invariant of interest. In this paper we study graphs of scramble number at most two, and give a classification of all…

We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph $G$ to evaluate to multiple zeta values. The criterion depends…

This is the first paper in a series whose goal is to give a polynomial time algorithm for the $4$-coloring problem and the $4$-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a…

We have examined quantum theories of electric magnetic duality invariant vector fields enjoying classical conformal invariance in 4-dimensional flat spacetime. We extend Dirac's argument about "the conditions for a quantum field theory to…

At four loops there first occurs a test of the four-term relation derived by the second author in the course of investigating whether counterterms from subdivergence-free diagrams form a weight system. This test relates counterterms in a…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

We provide evidence in favor of the conjectured duality between color and kinematics for the case of nonsupersymmetric pure Yang-Mills amplitudes by constructing a form of the one-loop four-point amplitude of this theory that makes the…

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

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…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

We study Feynman integrals in the representation with Schwinger parameters and derive recursive integral formulas for massless 3- and 4-point functions. Properties of analytic (including dimensional) regularization are summarized and we…

A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…

For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…

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…

We compute the family of Feynman integrals related to the H-graph with unequal masses in relativistic quantum field theory. We present an $\varepsilon$-factorised differential equation for the 40 master integrals. The alphabet consists of…

A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The complexity of colouring antiprismatic graphs is still…

Considering regions in a map to be adjacent when they have nonempty intersection (as opposed to the traditional view requiring intersection in a linear segment) leads to the concept of a facially complete graph: a plane graph that becomes…

Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…

Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…