Asymptotics of convex lattice polygonal lines with a constrained number of vertices
From MaRDI portal
Publication:1686395
DOI10.1007/s11856-017-1599-3zbMath1394.52017arXiv1606.05062OpenAlexW2767798626MaRDI QIDQ1686395
Julien Bureaux, Nathanaël Enriquez
Publication date: 22 December 2017
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05062
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cites Work
- Unnamed Item
- Universality of the limit shape of convex lattice polygonal lines
- Integer points on curves and surfaces
- Invariant convex cones and orderings in Lie groups
- Large deviations in the geometry of convex lattice polygons
- Independent process approximations for random combinatorial structures
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- Sylvester's question: The probability that \(n\) points are in convex position
- The limit shape of convex lattice polygons
- Probability that \(n\) random points are in convex position
- Probabilistic approach to the analysis of statistics for convex polygonal lines
- The limit shape of convex lattice polygons and related topics
- A central limit theorem for convex chains in the square
- The number of integral points on arcs and ovals
- The distribution of the number of summands in the partitions of a positive integer
- On the number of lattice convex chains
- Partitions of large unbalanced bipartites