Counting self-avoiding walks on the hexagonal lattice
| dc.bibliographicCitation.seriesTitle | Snapshots of Modern Mathematics from Oberwolfach | eng |
| dc.bibliographicCitation.volume | 6/2019 | |
| dc.contributor.author | Duminil-Copin, Hugo | |
| dc.date.accessioned | 2022-08-05T08:00:54Z | |
| dc.date.available | 2022-08-05T08:00:54Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | In how many ways can you go for a walk along a lattice grid in such a way that you never meet your own trail? In this snapshot, we describe some combinatorial and statistical aspects of these so-called self-avoiding walks. In particular, we discuss a recent result concerning the number of self-avoiding walks on the hexagonal (“honeycomb”) lattice. In the last part, we briefly hint at the connection to the geometry of long random self-avoiding walks. | eng |
| dc.description.version | publishedVersion | eng |
| dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/9909 | |
| dc.identifier.uri | http://dx.doi.org/10.34657/8947 | |
| dc.language.iso | eng | |
| dc.publisher | Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach gGmbH | |
| dc.relation.doi | https://doi.org/10.14760/SNAP-2019-006-EN | |
| dc.relation.essn | 2626-1995 | |
| dc.rights.license | CC BY-SA 4.0 Unported | eng |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | eng |
| dc.subject.ddc | 510 | |
| dc.subject.other | Probability Theory and Statistics | eng |
| dc.title | Counting self-avoiding walks on the hexagonal lattice | eng |
| dc.type | Report | eng |
| dc.type | Text | eng |
| dcterms.extent | 11 S. | |
| tib.accessRights | openAccess | |
| wgl.contributor | MFO | |
| wgl.subject | Mathematik | |
| wgl.type | Report / Forschungsbericht / Arbeitspapier |
Files
Original bundle
1 - 1 of 1