A polygon is a self-avoiding cycle in the hypercubic lattice \(\mathbb{Z}^d\) taking at least one step in every dimension. It is convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. An asymptotic expression is given for the number \(p_{n,d}\) of \(d\)-dimensional convex polygons of length \(2n\) with \(d(n)\to\infty\). Results are proved by asymptotically enumerating a larger class of objects called convex proto-polygons by the saddle-point method and then finding the asymptotic probability that a randomly chosen proto-polygon is a polygon.
- Algebraic languages and polyominoes enumeration
- Enumeration of Almost-Convex Polygons on the Square Lattice
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 863491 (Why is no real title available?)
- scientific article; zbMATH DE number 932188 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
- Enumeration of three-dimensional convex polygons
- On fully extended self-avoiding polygons
- Free polygon enumeration and the area of an integral polygon
- scientific article; zbMATH DE number 5542490 (Why is no real title available?)
- The Number of Rooted Convex Polyhedra
- Enumeration of Almost-Convex Polygons on the Square Lattice
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON
- scientific article; zbMATH DE number 1132830 (Why is no real title available?)
- The number of three-choice polygons
This page was built for publication: Asymptotic enumeration of convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374182)
