Convex lattice polygonal lines with a constrained number of vertices
classification
🧮 math.PR
keywords
constrainedconvexlatticelinesnumberpolygonalverticesanalysis
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.