Doc shows lattice([[1,2,3],[-1,0,1],[0,1,1]]); [[-1, 0, 1], [0, 1, 1], [0, -1, 1]] but then lattice([[-1,0,1],[0,1,1],[1,2,3]]); [[-1, 0, 1], [0, 1, 1], [1, -1, 0]] Why not some permutation of the first result? For less trivial lattices, the consequences of permuting the vectors become large, so that some of the shortest vectors are missing from most of the answers. E.g., looking for close products of small primes, I found 2 3 3 11 41 67 71 79 36100763589 31 41 59 79 20621900011 ----------------- = ----------- and --------------- = -----------, 3 36100763591 2 3 20621900013 19 23 31 47 59 3 11 13 37 73 but nothing this good when I reversed the list of vectors. Is this a bug in Maple, or a property of LLL? --rwg