Links and cubic 3-polytopes

CORC > 厦门大学 > 数学科学－已发表论文

	Links and cubic 3-polytopes
	Yang, WL ; Zhang, FJ ; Zhang FJ(张福基)
刊名	http://dx.doi.org/10.1090/S0025-5718-08-02088-7
	2008
关键词	GRAPHS POLYNOMIALS
英文摘要	It is well known that a prime link diagram corresponds to a signed plane graph without cut vertices (Kauffman, 1989). In this paper, we present a new relation between prime links and cubic 3-polytopes. Let S be the set of links such that each L. S has a diagram whose corresponding signed plane graph is the graph of a cubic 3-polytope. We show that all nontrivial prime links, except (2, n)-torus links and (p, q, r)-pretzel links, can be obtained from S by using some operation of untwining. Furthermore, we de. ne the generalized cubic 3-polytope chains and then show that any nontrivial link can be obtained from S by some untwining operations, where S is the set of links corresponding to generalized cubic 3-polytope chains. These results are used to simplify the computation of the Kauffman brackets of links so that the computing can be done in a unified way for many in finite families of links.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66354]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Yang, WL,Zhang, FJ,Zhang FJ. Links and cubic 3-polytopes[J]. http://dx.doi.org/10.1090/S0025-5718-08-02088-7,2008.
APA	Yang, WL,Zhang, FJ,&张福基.(2008).Links and cubic 3-polytopes.http://dx.doi.org/10.1090/S0025-5718-08-02088-7.
MLA	Yang, WL,et al."Links and cubic 3-polytopes".http://dx.doi.org/10.1090/S0025-5718-08-02088-7 (2008).