Related papers: The Kauffman polynomial and trivalent graphs
In this paper, we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. In previous work, we gave a polynomial…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We use topological quantum field theory to derive an invariant of a three-manifold with boundary. We then show how to use this invariant as an obstruction to embedding one three-manifold in another.
We present an example of a fibred quadratic polynomial admitting an attracting invariant 2-curve. By an unfolding construction we obtain an example of a fibred quadratic polynomial admitting two attracting invariant curves. This phenomena…
We generalize the construction of the Heegaard Floer homology for a singular knot to that for a balanced bipartite graph. For a given graph, we provide a combinatorial description of the Euler characteristic of its Heegaard Floer homology…
We construct hierarchies of integrable systems invariant under the two-dimensional Darboux-Toda mapping for noncommuting objects, thus generalizing to the noncommutative case the integrable mapping approach to nonlinear dynamical systems.…
We study framed links in irreducible 3-manifolds that are $Z$-homology 3-spheres or atoroidal $Q$-homology 3-spheres. We calculate the dual of the Kauffman skein module over the ring of two variable power series with complex coefficients.…
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
This paper offers a review of recent studies on the entanglement of free-fermion systems on graphs that take advantage of methods pertaining to signal processing and algebraic combinatorics. On the one hand, a parallel with time and band…
We derive a formula expanding the bracket with respect to a natural deformation parameter. The expansion is in terms of a two-variable polynomial algebra of diagram resolutions generated by basic operations involving the Goldman bracket. A…
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the…
We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…
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…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers.…
Bargmann invariants, a class of gauge-invariant quantities arising from the overlaps of quantum state vectors, provide a profound and unifying framework for understanding the geometric structure of quantum mechanics. This survey offers a…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…