Pages that link to "Item:Q4694898"
From MaRDI portal
The following pages link to Algebraic techniques for enumerating self-avoiding walks on the square lattice (Q4694898):
Displaying 24 items.
- The enumeration of prudent polygons by area and its unusual asymptotics (Q640842) (← links)
- Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations (Q1306601) (← links)
- Self-avoiding walks (Q1323033) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Efficient algorithm for computing exact partition functions of lattice polymer models (Q1682942) (← links)
- Transfer matrix algorithm for computing the exact partition function of a square lattice polymer (Q2102475) (← links)
- New lower bounds on the self-avoiding-walk connective constant (Q2499874) (← links)
- On the algebraic area of lattice walks and the Hofstadter model (Q2960254) (← links)
- ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH (Q2986611) (← links)
- Automatic Classification of Restricted Lattice Walks (Q3176568) (← links)
- A new look at the collapse of two-dimensional polymers (Q3302400) (← links)
- History and Introduction to Polygon Models and Polyominoes (Q3651678) (← links)
- Mean area of self-avoiding loops (Q4492249) (← links)
- Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents (Q5061339) (← links)
- Synergistic development of differential approximants and the finite lattice method in lattice statistics (Q5269454) (← links)
- Scale-free Monte Carlo method for calculating the critical exponent<i>γ</i>of self-avoiding walks (Q5348309) (← links)
- The design of efficient dynamic programming and transfer matrix enumeration algorithms (Q5363387) (← links)
- New pattern theorems for square lattice self-avoiding walks and self-avoiding polygons (Q5757543) (← links)
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons (Q5873011) (← links)
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices (Q5878732) (← links)
- Enumeration of compact self-avoiding walks (Q5956317) (← links)
- Two-dimensional oriented self-avoiding walks with parallel contacts (Q5967030) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753) (← links)
