文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > KNOTS IN GRAPHS IN SUBSETS OF Z 3 C.E. SOTEROS
侵权投诉

KNOTS IN GRAPHS IN SUBSETS OF Z 3 C.E. SOTEROS

is knotted is investigated. For any given graph (embeddable in Z 3) without cut edges, it is shown that this probability approaches 1 at an exponential rate as the number of edges in the embedding goes to infinity. Furthermore, at least for a subset of the

KNOTS IN GRAPHS IN SUBSETS OF Z 3 C.E. SOTEROS

Abstract. The probability that an embedding of a graph in Z 3 is knotted is investigated. For any given graph (embeddable in Z 3 ) without cut edges, it is shown that this probability approaches 1 at an exponential rate as the number of edges in the embedding goes to in nity. Furthermore, at least for a subset of these graphs, the rate at which the probability approaches 1 does not depend on the particular graph being embedded. Results analogous to these are proved to be true for embeddings of graphs in a subset of Z 3 bounded by two parallel planes (a slab). In order to investigate the knotting probability of embeddings of graphs in a rectangular prism (an in nitely long rectangular tube in Z 3 ), a pattern theorem for selfavoiding polygons in a prism is proved. From this it is possible to prove that for any given eulerian graph, the probability that an embedding of the graph in a prism is knotted goes to 1 as the number of edges in the embedding goes to in nity. Then, just as for Z 3, there is at least a subset of these graphs for which the rate that this probability approaches 1 does not depend on the particular graph. Similar results are shown to hold in cases where restrictionsare placed on the number of edges per branch in a graph embedding. Key words. knots, graph embeddings, branched polymer, simple cubic lattice. AMS(MOS) subject classi cations. 82B41,57M25,05C10,05C80,05C30.

1. Introduction. In 1988 Sumners and Whittington 1] investigated questions about knottedness of a closed curve of given length embedded in the three dimensional integer lattice, Z 3 . They and, independently, Pippenger 2] showed that su ciently long closed curves embedded in Z 3 are almost surely knotted. Soteros, Sumners and Whittington 3] extended the results of Sumners and Whittington in several directions. In particular, they showed that all but exponentially few su ciently long closed curves embedded in Z 3 are highly composite knots, with any knot type appearing numerous times in the prime knot factorization. They also found that similar results hold for embeddings of graphs in Z 3 . These results are important to the study of models of polymers in dilute solution. Embeddings of a graph in Z 3 can be used to represent the possible conformations of a polymer with the structure of the given graph. Concerns about knottedness with regard to polymers are motivated by the fact that closed circular DNA has been observed to be knotted and that entanglements in proteins are believed to be relevant to their properties. There are at least two important questions that one would like to address using this model of polymers. How does knottedness depend on the particular structure of the polymer? How does knottedness depend on the geometrical constraints placed on the space in which the polymer is con ned? In this paper, these two questions are addressed by studying Department of Mathematics, University of Saskatchewan, Saska

toon, SK, Canada S7N 5E6. This work was supported by NSERC of Canada. 1

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email