Related papers: A few weight systems arising from intersection gra…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relation. Deng et al. then proved that this function on framed chord diagrams also satisfies the four-term…
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
We prove that the partial-dual genus polynomial considered as a function on chord diagrams satisfies the four-term relation. Thus it is a weight system from the theory of Vassiliev knot invariants.
There are two oriented 4-valent graphical models for the Kauffman polynomial: one (HJ) is obtained by combining Jaeger's formula and Kauffman-Vogel model for the Homflypt polynomial; the other (WF) is obtained by combining Kauffman-Vogel…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
In a recent paper Zhuoke Yang, New approaches to ${\mathfrak gl}(N)$ weight system, Izvestiya Mathematics, 2023, vol. 77:6, 150--166; arXiv:2202.12225 (2022) a construction of a weight system, which unifies ${\mathfrak gl}(N)$ weight…
We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to…
We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…
The concept of the hafnian first appeared in the works on quantum field theory by E. R. Caianiello. However, it also has an important combinatorial property: the hafnian of the adjacency matrix of an undirected weighted graph is equal to…
We construct a two-level weighted TQFT whose structure coefficents are equivariant intersection numbers on moduli spaces of admissible covers. Such a structure is parallel (and strictly related) to the local Gromov-Witten theory of curves…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
Let $G$ be a signed graph. Let $\hat{G}$ be the graph obtained from $G$ by replacing each edge $e$ by a chain or a sheaf. We first establish a relation between the $Q$-polynomial of $\hat{G}$[6] and the $W$-polynomial of $G$ [9]. Two…
We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel…
We will prove that some weighted graphs on the distance $k$-graph of hypercubes approximate the $q$-Hermite polynomial of a $q$-gaussian variable by providing an appropriate matrix model.