Self-avoiding walks and trails on the 3.122 lattice
From MaRDI portal
Publication:4654912
Abstract: We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the lattice. A result of Watson then allows us to find the generating function and growth constant of neighbour-avoiding walks on the covering lattice of the lattice which is tetra-valent. A mapping into walks on the covering lattice allows us to obtain improved bounds on the growth constant for a range of lattices.
Recommendations
- Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
- Self-avoiding walks on the simple cubic lattice
- Self-avoiding walks and polygons on the triangular lattice
- Self-avoiding walks on lattice strips
- Self-avoiding walk on a three-dimensional Manhattan lattice
- Self-avoiding walks and polygons on non-Euclidean lattices
- Scaling of self-avoiding walks and self-avoiding trails in three dimensions
- Self-avoiding trails with nearest-neighbour interactions on the square lattice
- Self-avoiding walks and trees in spread-out lattices
- scientific article; zbMATH DE number 4103108
Cited in
(10)- A numerical adaptation of self-avoiding walk identities from the honeycomb to other 2D lattices
- Self-avoiding walks and connective constants
- Spiral self-avoiding walks on the triangular lattice
- Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
- Self-avoiding walk on a three-dimensional Manhattan lattice
- On the total number of distinct self-interacting self-avoiding walks on three-dimensional fractal structures
- Self-avoiding trails with nearest-neighbour interactions on the square lattice
- Semiflexible crossing-avoiding trails on plane-filling fractals
- Counting Method for Multi-party Computation over Non-abelian Groups
- Exponential growth rate of lattice comb polymers
This page was built for publication: Self-avoiding walks and trails on the 3.122 lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654912)