Self-avoiding walks of specified lengths on rectangular grid graphs
From MaRDI portal
Publication:6122418
DOI10.1007/s00010-023-00977-8OpenAlexW4385238172MaRDI QIDQ6122418
László Major, Anna Pahikkala, László Szalay, László Németh
Publication date: 1 March 2024
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-023-00977-8
Factorials, binomial coefficients, combinatorial functions (05A10) Paths and cycles (05C38) Recurrences (11B37) Calculation of integer sequences (11Y55) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Self-avoiding walk on the complete graph
- Enumerating up-side self-avoiding walks on integer lattices
- Counting all self-avoiding walks on a finite lattice strip of width one and two
- Self-avoiding walks, the language of science, and Fibonacci numbers
- Critical scaling of lattice polymers confined to a box without endpoint restriction
- Counting all unfolded self-avoiding walks on a finite lattice strip of width three
- On the Number of Self-Avoiding Walks on Hyperbolic Lattices
- Critical behaviour of self-avoiding walks: that cross a square
- The length of self-avoiding walks on the complete graph
- Self-avoiding Walks of Lattice Strips
- Self-Avoiding Walks on Hyperbolic Graphs
- Self-avoiding walks crossing a square
- Self-avoiding walks contained within 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
This page was built for publication: Self-avoiding walks of specified lengths on rectangular grid graphs
