A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. In this talk, we will see how to find bounds of the number of distinct multiple self-avoiding polygons in the mxn rectangular grid on the square lattice. Multiple Self-avoiding polygon(MSAP)의 갯수의 상한과 하한을 구하는 방법을 알아본다.
타이거 세미나
| 제목 | (국문발표 20180508 Growth rate of quantum knot mosaics-part.1) 김영인 |
|---|---|
| 내용 |
|
| 첨부 |