Convex lattice polygonal lines with a constrained number of vertices
Julien Bureaux, Nathanaël Enriquez · arXiv (Cornell University) · 2016
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.