Self-avoiding walks contained within a square
From MaRDI portal
Recommendations
- Self-avoiding walks and polygons confined to a square
- Self-avoiding walks crossing a square
- Self-avoiding walks in a rectangle
- Self‐avoiding walk on the hypercube
- Enumeration of self-avoiding walks on the square lattice
- The shape of self-avoiding walks
- Self-avoiding walks on the simple cubic lattice
- Self-avoiding walks and polygons on quasiperiodic tilings
- Self-avoiding walks and polygons on the triangular lattice
- scientific article; zbMATH DE number 1195748
Cites work
- Critical scaling of lattice polymers confined to a box without endpoint restriction
- Enumeration of self-avoiding walks on the square lattice
- scientific article; zbMATH DE number 3646898 (Why is no real title available?)
- Self-avoiding walks crossing a square
- Series analysis
- Series extension: predicting approximate series coefficients from a finite number of exact coefficients
Cited in
(9)- Counting walks by their last erased self-avoiding polygons using sieves
- scientific article; zbMATH DE number 6456216 (Why is no real title available?)
- Self-avoiding walks crossing a square
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
- Exact solution of weighted partially directed walks crossing a square
- Self-avoiding walks and polygons confined to a square
- The gerrymander sequence, or A348456
- Self-avoiding walks of specified lengths on rectangular grid graphs
- Step-constrained self-avoiding walks on finite grids
This page was built for publication: Self-avoiding walks contained within a square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874168)
