Related papers: The Kauffman polynomial and trivalent graphs
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
Starting from a given topological invariant, we argue that it is possible to construct a topological field theory with a finite number of Feynman diagrams and an amplitude of gauge invariant objects that is a function of that invariant.…
We use Kauffman's bracket polynomial to define a complex-valued invariant of virtual rational tangles that generalizes the well-known fraction invariant for classical rational tangles. We provide a recursive formula for computing the…
In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
We introduce an Alexander polynomial for MOY graphs. For a framed trivalent MOY graph $\mathbb{G}$, we refine the construction and obtain a framed ambient isotopy invariant $\Delta_{(\mathbb{G},c)}(t)$. The invariant $\Delta_{(\mathbb{G},…
The Kalman variety of a linear subspace in a vector space consists of all endomorphism that possess an eigenvector in that subspace. We study the defining polynomials and basic geometric invariants of the Kalman variety.
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
We give a geometric construction of the multivariable Conway potential function for colored links. In the case of a single color, it is Kauffman's definition of the Conway polynomial in terms of a Seifert matrix.
In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…
The existence of conservative quasipolynomial (QP) maps is investigated. A classification is given for dimensions two and three, and the analytical solution of the former case is constructed. General properties of n-dimensional QP…