Abstract
Many open problems in machine learning, pattern recognition, and geometric analysis require enumeration of different types of lattice polygons, and in particular convex polyominoes. In this work, we develop a large deviation principle for convex polyominoes under different restrictions, such as fixed area and/or perimeter.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
