Abstract
A subset of the set of self-avoiding polygons (SAP) embeddable on the square lattice which display the property of convexity is defined. An algorithm for their enumeration is developed, and from the available series coefficients the exact generating function is found. The singularity structure appears similar to that of the unsolved SAP problem, but with different critical exponents and critical points. The enumeration of convex polygons allows the extension of the existing series for the square lattice SAP by one term. For the honeycomb lattice similar results have been obtained, despite a less natural definition of convexity.
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.
