Related papers: Invariants of Spatial Graphs
We study tangle replacement in the context of spatial graphs. The main results show that, for certain spatial handcuff graphs, there is a one-to-one correspondence between the neighborhood equivalence classes of the spatial graphs obtained…
We define a two-variable polynomial invariant of finite quandles. In many cases this invariant completely determines the algebraic structure of the quandle up to isomorphism. We use this polynomial to define a family of link invariants…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
We introduce a new invariant of tangles along with an algebraic framework in which to understand it. We claim that the invariant contains the classical Alexander polynomial of knots and its multivariable extension to links. We argue that of…
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…
Defined by Joyce and Matveev, the fundamental quandle is a complete invariant of oriented classical knots. We consider invariants of knots defined from quotients of the fundamental quandle. In particular, we introduce the fundamental Latin…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
This paper is a brief overview of some of our recent results in collaboration with other authors. The cocycle invariants of classical knots and knotted surfaces are summarized, and some applications are presented.
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We define and study twisted Alexander-type invariants of complex hypersurface complements. We investigate torsion properties for the twisted Alexander modules and extend classical local-to-global divisibility results to the twisted setting.…
Closed geodesics associated with indefinite binary quadratic forms, or equivalently with real quadratic irrationals, have long been studied as geometric $\mathrm{SL}_2(\mathbb{Z})$-invariants. Building on the Birman-Williams approach to…
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
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…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The Eynard-Orantin invariants of a plane curve are multilinear differentials on the curve. For a particular class of genus zero plane curves these invariants can be equivalently expressed in terms of simpler expressions given by polynomials…