B = 40 -7 1 μ21 = 819/1650, μ31 = 382/1650, μ21 = 13842/45339, 19 -8 3 9 -3 1while ||b2*||2 = 45339/1650 and ||b1*||2 = 1650. The proof of Theorem 5.1 breaks down for these numbers, but nevertheless, b3 = [9, -3, 1] is a (unique) shortest multiplier.
B = -1 1 0 1 2 -2 -1 0 1Then b3 = [-1, 0, 1] and b3 - b1 = [0, -1, 1] are the shortest multipliers.
B = 3 -4 1 μ21 = -7/26, μ31 = 1/2, -10 -3 11 μ32 = -2899/5931. 6 0 -5Then b3 = [6, 0, -5], b3 - b1 = [3, 4, -6] and b3 + b2 = [-4, -3, 6] are the shortest multipliers.
In Reduce2(k,i) replace
If there is a j such that ak,j ≠ 0 then
col2 ← least j such that ak,j ≠ 0;
else col2 ← n+1;
with
If there is j such that ak,j ≠ 0 then
col2 ← least j such that ak,j ≠ 0;
if ak,col2 < 0 then minus(k); ak ← -ak; bk ← -bk;
else col ← n+1;
This correction is not mentioned in the book An Introduction to the LLL Algorithm and Its Applications of Murray R. Bremner.
Last modified 1st November 2022