On the reduction of a random basis

Details On the reduction of a random basis On the reduction of a random basis

2006-04-14

arxiv.org/abs/math/0604331v1

Mathematics

Probability

Scientific paper

For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is to provide asymptotic results when $n\to +\infty$ concerning the property that such a random basis is reduced in the sense of {\sc Lenstra, Lenstra & Lov\'asz}. The proof passes by the study of the process $(r\_{g+1}^{(n)},r\_{g+2}^{(n)},...,r\_{n-1}^{(n)})$ where $r\_j^{(n)}$ is the ratio of lengths of two consecutive vectors $b^*\_{n-j+1}$ and $b^*\_{n-j}$ built from $(b\_1,...,b\_{n-g})$ by the Gram--Schmidt orthogonalization procedure, which we believe to be interesting in its own. We show that, as $n\to+\infty$, the process $(r\_j^{(n)}-1)\_j$ tends in distribution in some sense to an explicit process $({\mathcal R}\_j -1)\_j$; some properties of this latter are provided.

Affiliated with

Also associated with

No associations

Rating

On the reduction of a random basis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the reduction of a random basis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the reduction of a random basis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623846