Abstract
We argue by analogy with other exactly solved models that the self-avoiding polygon problem is likely to be simpler than the self-avoiding walk problem. By greatly extending the series expansions for the square lattice polygon generating function, we obtain very precise numerical information, as well as good evidence for a particular underlying functional form. The exact solution of the (simpler) convex polygon problem is obtained, and current work on the hexagonal lattice polygon problem is described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
