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.
Funding Statement
This work was supported in part by ONR grant No. N000141812244.
Citation
Ilya Soloveychik. Vahid Tarokh. "Large deviations of convex polyominoes." Electron. J. Probab. 27 1 - 19, 2022. https://doi.org/10.1214/22-EJP835
Information
