Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/16616
Title: Pattern Theorem for the Hexagonal Lattice
Authors: PRITHA GUHA
Keywords: Cubic Lattice, Hexagonal Lattice, Self-avoiding Random Walk, Linear Polymer, Patterns, Connective Constant
Issue Date: 29-Jan-2009
Source: PRITHA GUHA (2009-01-29). Pattern Theorem for the Hexagonal Lattice. ScholarBank@NUS Repository.
Abstract: A linear polymer can be thought of as a flexible long chain of beads that follows a lattice where each bead represents a monomer unit. It can be modelled as a self-avoiding random walk on a lattice. When the linear polymer is in a chemical solution and is following a 2-dimensional hexagonal lattice, it becomes self-entangled. It can be shown that in all su ciently long polymers a pattern is present. Kesten's Pattern Theorem, which was originally proved for self-avoiding walks on cubic lattices, is extended to the self-avoiding walks on hexagonal lattices. Properties of the hexagonal lattice, self-avoiding walks on the hexagonal lattice and the connective constant for the hexagonal lattice are then provided. Further, computation of the probability of a self-avoiding walk on the hexagonal lattice encircling the points (1/2,1/2) and (1/2,-1/2) is discussed.
URI: http://scholarbank.nus.edu.sg/handle/10635/16616
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
GuhaP.pdf681.48 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

222
checked on Dec 11, 2017

Download(s)

189
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.