On the Poisson distribution of lengths of lattice vectors in a random lattice

@article{Sdergren2010OnTP,
  title={On the Poisson distribution of lengths of lattice vectors in a random lattice},
  author={Anders S{\"o}dergren},
  journal={Mathematische Zeitschrift},
  year={2010},
  volume={269},
  pages={945-954}
}
  • A. Södergren
  • Published 20 January 2010
  • Mathematics
  • Mathematische Zeitschrift
We prove that the volumes determined by the lengths of the non-zero vectors ±x in a random lattice L of covolume 1 define a stochastic process that, as the dimension n tends to infinity, converges weakly to a Poisson process on the positive real line with intensity $${\frac{1}{2}}$$ . This generalizes earlier results by Rogers (Proc Lond Math Soc (3) 6:305–320, 1956, Thm. 3) and Schmidt (Acta Math 102:159–224, 1959, Satz 10). 

On the distribution of lengths of short vectors in a random lattice

We use an idea from sieve theory—specifically, an inclusion–exclusion argument inspired by Schmidt (Proc Am Math Soc 9:390–403, 1958)—to estimate the distribution of the lengths of kth shortest

On the distribution of lengths of short vectors in a random lattice

We use an idea from sieve theory—specifically, an inclusion–exclusion argument inspired by Schmidt (Proc Am Math Soc 9:390–403, 1958)—to estimate the distribution of the lengths of kth shortest

On a mean value formula for multiple sums over a lattice and its dual

. We prove a generalized version of Rogers’ mean value formula in the space X n of unimodular lattices in R n , which gives the mean value of a multiple sum over a lattice L and its dual L ∗ . As an

On the generalized circle problem for a random lattice in large dimension

On the location of the zero-free half-plane of a random Epstein zeta function

In this note we study, for a random lattice L of large dimension n, the supremum of the real parts of the zeros of the Epstein zeta function $$E_n(L,s)$$En(L,s) and prove that this random variable

On the distribution of angles between the N shortest vectors in a random lattice

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n‐dimensional lattice as n→∞. Moreover, we interpret the result in terms of

Random lattice vectors in a set of size O(n)

We adopt the sieve ideas of Schmidt and S\"odergren in order to study the statistics of vectors of a random lattice of dimension n contained in a set of volume O(n). We also give some sporadic

On the value distribution of the Epstein zeta function in the critical strip

We study the value distribution of the Epstein zeta function En(L, s) for 0 < s < n 2 and a random lattice L of large dimension n. For any fixed c ∈ ( 1 4 , 1 2 ) and n → ∞, we prove that the random

References

SHOWING 1-10 OF 20 REFERENCES

The moments of the number of points of a lattice in a bounded set

  • C. A. Rogers
  • Mathematics
    Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1955
A certain average value of the kth power of the number of points of a lattice, with determinant 1, in a bounded n-dimensional set S is evaluated in terms of the volumes of certain sets of dimensions

Mean values over the space of lattices

t . Various methods have been used for calculating the mean value of a function, defined for all lattices of determinant 1, over some or all the lattices of determinant 1. I t is accepted tha t the

Convergence of probability measures

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the

Poisson Processes

  • M. R. Leadbetter
  • Mathematics
    International Encyclopedia of Statistical Science
  • 2011
Consider a Random Process that models the occurrence and evolution of events in time and the random variable N(t) which represents the largest n, such that Sn( t) ≤ t.

Correlations of Eigenvalues on¶Multi-Dimensional Flat Tori

Abstract:We show that, for almost all k-dimensional flat tori, the eigenvalues of the Laplacian follow a uniform distribution with respect to their 2-, 3-, …, and [k/2]-level correlations.

Introduction to Number Theory

This seems simple enough, but let’s play with this definition. The Pythagoreans, an ancient sect of mathematical mystics, said that a number is perfect if it equals the sum of its positive integral

A random graph

  • S. Ross
  • Mathematics
    Journal of Applied Probability
  • 1981
The probability that the above so-called random graph is connected is determined and a recursive formula is developed for the distribution of C, the number of connected components it contains, which derives expressions for the mean and variance of C.

Random graphs

  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.

A lower bound for the optimal density of lattice packings