MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider some lattice in R^4 (C^4) or C^8. Famous "lattice reduction" procedures (like LLL latice reduction) produces some "reduced basis". However in general there results are not "the best reduced".

Is there some understanding (at least informal) what are the conditions on lattice such that LLL (or similar) reduction will produce "the best result" ?

More precisely let me consider the following situation - take a 4*4 matrix and generate its elements from normal distribution N(0,1). Consider the lattice generated by the columns of this matrix. What is the probability that LLL-reduction will produce the "best results" ?

I have made some (not many) experiments with LLL reduction - the integer valued matrices which change original random basis to "reduced one" have quite small coefficients in many cases +-1 sometimes 2,3 but rarely more... well these are not "well-checked" observations... What does it mean ? Does it correspond to some theory ?

share|cite|improve this question

This paper

"On the reduction of a random basis" by Ali Akhavi,Jean-Francois Marckert, and Alain Rouault

purports to answer your question.

Added later: There is a real question about what is the right meaning of a "random lattice". You should see the paper "On the equidistribution of Hecke points" by Daniel Goldstein and Andrew Mayer Forum Mathematicorum Volume 15, Issue 2, Pages 165–189. In that paper they look at the natural Haar measure on the space of $n$-dimensional lattices.

share|cite|improve this answer
Thank You very much ! – Alexander Chervov Apr 17 '11 at 5:36

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.