Related papers: The Kauffman polynomial and trivalent graphs
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…
This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…
We investigate the relationship between the universal topological polynomials for graphs in mathematics and the parametric representation of Feynman amplitudes in quantum field theory. In this first paper we consider translation invariant…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees,…
We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…
We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
A state generating is introduced to determine the Jones polynomial of a link. Formulae for two infinite families of knots are shown by applying this method, the second family of which are proved to be non-alternating. Moreover, the method…
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
Two criteria for planarity of a Feynman diagram upon its propagators (momentum flows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while…
This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…
Given any diagram of a link, we define on the cube of Kauffman's states a "2-complex" whose homology is an invariant of the associated framed links, and such that the graded Euler characteristic reproduces the unnormalized Kauffman bracket.…
A novel family of integrable third order maps is presented. Each map possesses, by construction, a pair of rational invariants and a commuting map from the same class. The 3-dimensional invariant curve is parametrized, in general, by an…
We study tropically planar graphs, which are the graphs that appear in smooth tropical plane curves. We develop necessary conditions for graphs to be tropically planar, and compute the number of tropically planar graphs up to genus $7$. We…
In this paper, we investigate the properties of locally univalent and multivalent planar harmonic mappings. First, we discuss the coefficient estimates and Landau's Theorem for some classes of locally univalent harmonic mappings, and then…
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…