Abstract
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their ‘concavity index’, m. Such polygons are called m-convex polygons. We first use the inclusion–exclusion principle to rederive the known generating function for 1-convex self-avoiding polygons (SAPs). We then use our results to derive the exact anisotropic generating functions for osculating and neighbour-avoiding 1-convex SAPs, their isotropic form having recently been conjectured.
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.
