首页> 外文期刊>Journal of knot theory and its ramifications >The group G(n)(2) and invariants of free links valued in free groups
【24h】

The group G(n)(2) and invariants of free links valued in free groups

机译:G(n)(2)组和在自由组中值的自由链接的不变量

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this paper, we define an invariant of free links valued in a free product of some copies of Z(2). In [Non-Reidemeister knot theory and its applications in dynamical systems, geometry, and topology, preprint (2015), arXiv:1501.05208v1] the second author constructed a connection between classical braid group and group presentation generated by elements corresponding to horizontal trisecants. This approach does not apply to links nor tangles because it requires that when counting trisecants, we have the same number of points at each level. For general tangles, trisecants passing through one component twice may occur. Free links can be obtained from tangles by attaching two end points of each component. We shall construct an invariant of free links and free tangles valued in groups as follows: we associate elements in the groups with 4-valent vertices of free tangles (or free links). For a free link with enumerated component, we "read" all the intersections when traversing a given component and write them as a group element. The problem of "pure crossings" of a component with itself by using the following statement: if two diagrams with no pure crossings are equivalent then they are equivalent by a sequence of moves where no intermediate diagram has a pure crossing. This statement is a result of a sort that an equivalence relation within a subset coincides with the equivalence relation induced from a larger set and it is interesting by itself.
机译:在本文中,我们定义了Z(2)的某些副本的自由积中值的自由链接的不变量。在[非雷德迈斯特结理论及其在动力系统,几何学和拓扑结构中的应用,预印本(2015年),arXiv:1501.05208v1]中,第二作者在经典编织群和由对应于水平三等分线的元素生成的群表示之间建立了联系。此方法不适用于链接或缠结,因为它要求在计算三割线时,每个级别上的点数相同。对于一般的缠结,可能会发生三正割两次穿过一个分量的情况。通过连接每个组件的两个端点,可以从缠结中获得自由链接。我们将构造按组计算的自由链接和自由缠结的不变量,如下所示:将组中的元素与自由缠结(或自由链接)的4价顶点相关联。对于带有枚举组件的自由链接,我们在遍历给定组件时“读取”所有交集并将它们作为组元素写入。通过使用以下语句,组件与自身之间的“纯交叉”问题:如果两个没有纯交叉的图是等效的,则它们通过没有中间图具有纯交叉的移动序列等效。该陈述是某种结果的结果,子集中的等价关系与从较大的集合中得出的等价关系一致,并且它本身很有趣。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号