On the number of lattice convex chains

@article{Bureaux2016OnTN,
  title={On the number of lattice convex chains},
  author={Julien Bureaux and Nathanael Enriquez},
  journal={arXiv: Probability},
  year={2016},
  pages={1-15}
}
An asymptotic formula is presented for the number of planar lattice convex polygonal lines joining the origin to a distant point of the diagonal. The formula involves the non-trivial zeroes of the zeta function and leads to a necessary and sufficient condition for the Riemann Hypothesis to hold. 

Figures from this paper

Asymptotics of convex lattice polygonal lines with a constrained number of vertices

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

The asymptotic number of lattice zonotopes

We provide a sharp estimate for the asymptotic number of lattice zonotopes inscribed in [0, n] when n tends to infinity. Our estimate refines the logarithmic equivalent established by Barany,

Beyond Hammersley’s Last-Passage Percolation: a discussion on possible local and global constraints

Hammersley's Last-Passage Percolation (LPP), also known as Ulam's problem, is a well-studied model that can be described as follows: consider m points chosen uniformly and independently in $[0,1]^2$,

References

SHOWING 1-10 OF 20 REFERENCES

The limit shape of convex lattice polygons

It is proved here that, asn→∞, almost all convex (1/n)ℤ2-lattice polygons lying in the square [−1, 1]2 are very close to a fixed convex set.

On the Number of Convex Lattice Polygons

TLDR
This paper presents a meta-analyses of the determinants of infectious disease in eight operation theatres of the immune system and shows clear patterns in response to treatment-side-chain events.

On the Number of Convex Lattice Polytopes

A convex polytope P C R d is a lattice polytope if all of its vertices come from the lattice of integers, Z d. Write :P or ~Pd for the set of all convex lattice polytopes with positive volume. Two

Partitions of large unbalanced bipartites

  • Julien Bureaux
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2014
Abstract We compute the asymptotic behaviour of the number of partitions of large vectors (n1, n2) of ℤ+2 in the critical regime n1 ≍ √n2 and in the subcritical regime n1 = o(√n2). This work

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes

TLDR
From this work, a combinatorial symbolic description of digitally convex polyominoes is derived and used to analyze their limit properties and build a uniform sampler.

The Theory of the Riemann Zeta-Function

The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it our most important tool in the study of prime numbers. This volume studies all aspects

Universality of the limit shape of convex lattice polygonal lines

Let ${\varPi}_n$ be the set of convex polygonal lines $\varGamma$ with vertices on $\mathbb {Z}_+^2$ and fixed endpoints $0=(0,0)$ and $n=(n_1,n_2)$. We are concerned with the limit shape, as

Vershik, The limit form of convex integral polygons and related problems, Funktsional

  • Anal. i Prilozhen
  • 1994

Sinai, A probabilistic approach to the analysis of the statistics of convex polygonal lines, Funktsional

  • Anal. i Prilozhen
  • 1994

Sinaı̆, A probabilistic approach to the analysis of the statistics of convex polygonal lines, Funktsional

  • Anal. i Prilozhen
  • 1994