Thomas Fleming, Blake Mellor
Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results. We state the definitions, provide some examples, and survey the known results. We hope that this paper will help lead to rapid development of the area.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several examples of intrinsically virtually linked and knotted graphs. As a byproduct, we introduce the {\it virtual unknotting number} of a knot, and show that any knot with non-trivial Jones polynomial has virtual unknotting number at least 2.
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known results, we give topological interpretations of graphoids. There are several applications to virtual graphoid theory. First, virtual graphoids are suitable objects for studying knotted graphs with open ends arising in proteins. Second, a virtual graphoid can be thought of as a way to represent a virtual spatial graph without using as many crossings, which can be a…
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links into an invariant of ribbon graphs, and vice versa.
A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs
本文通过欧拉回路展开为棋盘可着色四价虚拟图定义新多项式，并据此给出相应虚拟链环 Kauffman-Jones 多项式的新组合刻画。
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
Multi-Virtual Knot Theory
本文提出多虚拟结理论，基于图论扩展Penrose评估至所有三元图，并探讨多虚拟结的拓扑性质与应用。
The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded into a (higher genus) surface. For such graphs we use the generalization of the Tutte polynomial discovered by B.Bollobas and O.Riordan.
Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form, combinatorially, virtual spatial graph theory. In this paper, we introduce a topological definition of virtual spatial graphs that is similar to the topological definition of a virtual link. Our main goal is to generalize the classical Yamada polynomial that is defined for a spatial graph. We define a generalized Yamada polynomial for a virtual spatial graph and prove that it can be normalized to a rigid vertex isot…
An Invariant of Virtual Trivalent Spatial Graphs
本文通过虚拟 Niebrzydowski 代数着色构造虚拟 Y 定向三价空间图的不变量，推广了已有 tribracket 着色不变量，并提供拉丁立方体与代数数据集以支持计算实现。
For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In the article we shall prove that a virtual link L is graphical if and only if it is checkerboard colorable. On the other hand, we introduce a polynomial F[G] for signed cyclic graphs, which is defined via a deletion-marking recursion. We shall establish the relationship between F[G] of a signed cyclic graph G and the …
In this paper, we mainly discuss the representations of closed graph manifolds to the Seifert motion group. Then we prove that there exist graph manifolds virtually having no faithful representations to the Seifert motion group.
We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollobás-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally behaves with respect to the partial duality of ribbon graphs. We construct an arrow ribbon graph from a virtual link whose extended Bollobás-Riordan polynomial specializes to the arrow polynomial of the virtual link recently introduced by H.Dye and L.Kauffman. This result generalizes the classical Thistlethwaite theorem to the arrow polynomial of virtual links.
We construct graph-valued analogues of the Kuperberg sl(3) and G2 invariants for virtual knots. The restriction of the sl(3) or G2 invariants for classical knots coincides with the usual Homflypt sl(3) invariant and G2 invariants. For virtual knots and graphs these invariants provide new graphical information that allows one to prove minimality theorems and to construct new invariants for free knots (unoriented and unlabeled Gauss codes taken up to abstract Reidemeister moves). A novel feature of this approach is that some knots are of sufficient complexity that they evaluate themselves in the…
We show that the Kauffman bracket $[L]$ of a checkerboard colorable virtual link $L$ is an evaluation of the Bollobás-Riordan polynomial $R_{G_L}$ of a ribbon graph associated with $L$. This result generalizes Thistlethwaite's celebrated theorem relating the Kauffman bracket with the Tutte polynomial of planar graphs.
By generalizing the Kuperberg sl(3) bracket, we construct a graph-valued analogue of the Homflypt sl(3) invariant for virtual knots. The restriction of this invariant for classical knots coincides with the usual Homflypt sl(3) invariant, and for virtual knots and graphs it provides new information that allows one to prove minimality theorems and to construct new invariants for free knots. We formulate this new invariant for virtual braids as well, and show that it leads to the construction of a trace function on the virtual Hecke algebra. Finally, we show that the Penrose coloring bracket is a…
Ascending, Bridge, and Unknotting Numbers of Knotted Graphs
本文为虚拟和焊接空间图定义上升数与桥数，证明上升数以桥数为下界，并借此比较通过交叉变更解纽的不同概念。
In this paper, we show that a nontrivial compact graph manifold is nonpositively curved if and only if its fundamental group virtually embeds into a right-angled Artin group. As a consequence, nonpositively curved graph manifolds have linear fundamental groups.
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, the $S$-polynomial, and formulate the $\mathfrak{sl}(N)$ Penrose polynomial for non-cubic graphs, giving contraction-deletion relations. The $S$-polynomial is used to define an extension of the Yamada polynomial to virtual spatial graphs, and with it we obtain a sufficient conditi…
Bridge numbers of virtual graphs and handlebody-links
本文研究图、虚拟图及柄体类的桥指标，构造虚拟ravel等例子，证明多种桥指标差异无界，并给出Suzuki曲线边连通和的精确指标。
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with the same equivalence relations we get `graph-links'. On one hand graph-links generalise the notion of virtual link, on the other hand they do not feel link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalisation of the Kauffman-Murasugi-Thistlethwaite theorem on `minmal diagrams' for graph-links
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss codes via knot diagrams with virtual crossings. This paper gives basic results and examples (such as non-trivial virtual knots with trivial Jones polynomial), studies fundamental group and quandles of virtual knots, extensions of the bracket and Jones polynomials, quantum link i…
Virtual homological torsion in graphs of free groups with cyclic edge groups
本文证明带循环边群的自由群图的双曲群，除非是自由群与曲面群的自由积，其有限指数子群的阿贝尔化包含任意有限阿贝尔群作为直和项，并由此推出自由积的 profinite 刚性及部分曲面词由词测度决定。
In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving non-trivial invariants strictly smaller than the one given by the Higman-Sims spin model. In particular, we exhibit a family of skein theories coming from $\text{Rep}(O(2))$ with an interesting braiding. In addition, all skein theories of oriented virtual tangles with some smallness conditions are classified. In the second half of the paper, we classify all non-trivi…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。