def short_vector_list_up_to_length(self, len_bound, up_to_sign_flag=False):
"""
Return a list of lists of short vectors `v`, sorted by length, with
Q(`v`) < len_bound. The list in output `[i]` indexes all vectors of
length `i`. If the up_to_sign_flag is set to True, then only one of
the vectors of the pair `[v, -v]` is listed.
Note: This processes the PARI/GP output to always give elements of type `ZZ`.
OUTPUT:
a list of lists of vectors.
EXAMPLES::
sage: Q = DiagonalQuadraticForm(ZZ, [1,3,5,7])
sage: Q.short_vector_list_up_to_length(3)
[[(0, 0, 0, 0)], [(1, 0, 0, 0), (-1, 0, 0, 0)], []]
sage: Q.short_vector_list_up_to_length(4)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0), (-1, 0, 0, 0)],
[],
[(0, 1, 0, 0), (0, -1, 0, 0)]]
sage: Q.short_vector_list_up_to_length(5)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0), (-1, 0, 0, 0)],
[],
[(0, 1, 0, 0), (0, -1, 0, 0)],
[(1, 1, 0, 0),
(-1, -1, 0, 0),
(-1, 1, 0, 0),
(1, -1, 0, 0),
(2, 0, 0, 0),
(-2, 0, 0, 0)]]
sage: Q.short_vector_list_up_to_length(5, True)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0)],
[],
[(0, 1, 0, 0)],
[(1, 1, 0, 0), (-1, 1, 0, 0), (2, 0, 0, 0)]]
sage: Q = QuadraticForm(matrix(6, [2, 1, 1, 1, -1, -1, 1, 2, 1, 1, -1, -1, 1, 1, 2, 0, -1, -1, 1, 1, 0, 2, 0, -1, -1, -1, -1, 0, 2, 1, -1, -1, -1, -1, 1, 2]))
sage: vs = Q.short_vector_list_up_to_length(40) #long time
The cases of ``len_bound < 2`` led to exception or infinite runtime before.
::
sage: Q.short_vector_list_up_to_length(0)
[]
sage: Q.short_vector_list_up_to_length(1)
[[(0, 0, 0, 0, 0, 0)]]
In the case of quadratic forms that are not positive definite an error is raised.
::
sage: QuadraticForm(matrix(2, [2, 0, 0, -2])).short_vector_list_up_to_length(3)
Traceback (most recent call last):
...
ValueError: Quadratic form must be positive definite in order to enumerate short vectors
Sometimes, Pari does not compute short vectors correctly. It returns too long vectors.
::
sage: mat = matrix(2, [72, 12, 12, 120]) #long time
sage: len_bound = 22953421 #long time
sage: gp_mat = gp.qfminim(str(gp(mat)), 2 * len_bound - 2)[3] #long time
sage: rows = [ map(ZZ, str(gp_mat[i,])[1:-1].split(',')) for i in range(1, gp_mat.matsize()[1] + 1) ] #long time
sage: vec_list = map(vector, zip(*rows)) #long time
sage: eval_v_cython = cython_lambda( ", ".join( "int a{0}".format(i) for i in range(2) ), " + ".join( "{coeff} * a{i} * a{j}".format(coeff = mat[i,j], i = i, j = j) for i in range(2) for j in range(2) ) ) #long time
sage: any( eval_v_cython(*v) == 2 * 22955664 for v in vec_list ) # 22955664 > 22953421 = len_bound #long time
True
"""
if not self.is_positive_definite():
raise ValueError(
"Quadratic form must be positive definite in order to enumerate short vectors"
)
## Generate a PARI matrix string for the associated Hessian matrix
M_str = str(gp(self.matrix()))
if len_bound <= 0:
return list()
elif len_bound == 1:
return [[(vector([ZZ(0) for _ in range(self.dim())]))]]
## Generate the short vectors
gp_mat = gp.qfminim(M_str, 2 * len_bound - 2)[3]
## We read all n-th entries at once so that not too many sage[...] variables are
## used. This is important when to many vectors are returned.
rows = [
map(ZZ,
str(gp_mat[i, ])[1:-1].split(','))
for i in range(1,
gp_mat.matsize()[1] + 1)
]
vec_list = map(vector, zip(*rows))
if len(vec_list) > 500:
eval_v_cython = cython_lambda(
", ".join("int a{0}".format(i) for i in range(self.dim())),
" + ".join(
"{coeff} * a{i} * a{j}".format(coeff=self[i, j], i=i, j=j)
for i in range(self.dim()) for j in range(i, self.dim())))
eval_v = lambda v: eval_v_cython(*v)
else:
eval_v = self
## Sort the vectors into lists by their length
vec_sorted_list = [list() for i in range(len_bound)]
for v in vec_list:
v_evaluated = eval_v(v)
try:
vec_sorted_list[v_evaluated].append(v)
if not up_to_sign_flag:
vec_sorted_list[v_evaluated].append(-v)
except IndexError:
## We deal with a Pari but, that returns longer vectors that requested.
## E.g. : self.matrix() == matrix(2, [72, 12, 12, 120])
## len_bound = 22953421
## gives maximal length 22955664
pass
## Add the zero vector by hand
zero_vec = vector([ZZ(0) for _ in range(self.dim())])
vec_sorted_list[0].append(zero_vec)
## Return the sorted list
return vec_sorted_list
def dimension__vector_valued(k, L, conjugate=False):
r"""
Compute the dimension of the space of weight `k` vector valued modular forms
for the Weil representation (or its conjugate) attached to the lattice `L`.
See [Borcherds, Borcherds - Reflection groups of Lorentzian lattices] for a proof
of the formula that we use here.
INPUT:
- `k` -- A half-integer.
- ``L`` -- An quadratic form.
- ``conjugate`` -- A boolean; If ``True``, then compute the dimension for
the conjugated Weil representation.
OUTPUT:
An integer.
TESTS::
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 1, 1, 2])))
1
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 0, 0, 2])))
1
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 0, 0, 4])))
1
"""
if 2 * k not in ZZ:
raise ValueError("Weight must be half-integral")
if k <= 0:
return 0
if k < 2:
raise NotImplementedError("Weight <2 is not implemented.")
if L.matrix().rank() != L.matrix().nrows():
raise ValueError(
"The lattice (={0}) must be non-degenerate.".format(L))
L_dimension = L.matrix().nrows()
if L_dimension % 2 != ZZ(2 * k) % 2:
return 0
plus_basis = ZZ(L_dimension + 2 * k) % 4 == 0
## The bilinear and the quadratic form attached to L
quadratic = lambda x: L(x) // 2
bilinear = lambda x, y: L(x + y) - L(x) - L(y)
## A dual basis for L
(elementary_divisors, dual_basis_pre, _) = L.matrix().smith_form()
elementary_divisors = elementary_divisors.diagonal()
dual_basis = map(operator.div, list(dual_basis_pre), elementary_divisors)
L_level = ZZ(lcm([b.denominator() for b in dual_basis]))
(elementary_divisors, _, discriminant_basis_pre) = (
L_level * matrix(dual_basis)).change_ring(ZZ).smith_form()
elementary_divisors = filter(lambda d: d not in ZZ,
(elementary_divisors / L_level).diagonal())
elementary_divisors_inv = map(ZZ, [ed**-1 for ed in elementary_divisors])
discriminant_basis = matrix(
map(operator.mul,
discriminant_basis_pre.inverse().rows()[:len(elementary_divisors)],
elementary_divisors)).transpose()
## This is a form over QQ, so that we cannot use an instance of QuadraticForm
discriminant_form = discriminant_basis.transpose() * L.matrix(
) * discriminant_basis
if conjugate:
discriminant_form = -discriminant_form
if prod(elementary_divisors_inv) > 100:
disc_den = discriminant_form.denominator()
disc_bilinear_pre = \
cython_lambda( ', '.join( ['int a{0}'.format(i) for i in range(discriminant_form.nrows())]
+ ['int b{0}'.format(i) for i in range(discriminant_form.nrows())] ),
' + '.join('{0} * a{1} * b{2}'.format(disc_den * discriminant_form[i,j], i, j)
for i in range(discriminant_form.nrows())
for j in range(discriminant_form.nrows())) )
disc_bilinear = lambda *a: disc_bilinear_pre(*a) / disc_den
else:
disc_bilinear = lambda *xy: vector(ZZ, xy[:discriminant_form.nrows(
)]) * discriminant_form * vector(ZZ, xy[discriminant_form.nrows():])
disc_quadratic = lambda *a: disc_bilinear(*(2 * a)) / 2
## red gives a normal form for elements in the discriminant group
red = lambda x: map(operator.mod, x, elementary_divisors_inv)
def is_singl(x):
y = red(map(operator.neg, x))
for (e, f) in zip(x, y):
if e < f:
return -1
elif e > f:
return 1
return 0
## singls and pairs are elements of the discriminant group that are, respectively,
## fixed and not fixed by negation.
singls = list()
pairs = list()
for x in mrange(elementary_divisors_inv):
si = is_singl(x)
if si == 0:
singls.append(x)
elif si == 1:
pairs.append(x)
if plus_basis:
subspace_dimension = len(singls + pairs)
else:
subspace_dimension = len(pairs)
## 200 bits are, by far, sufficient to distinguish 12-th roots of unity
## by increasing the precision by 4 for each additional dimension, we
## compensate, by far, the errors introduced by the QR decomposition,
## which are of the size of (absolute error) * dimension
CC = ComplexIntervalField(200 + subspace_dimension * 4)
zeta_order = ZZ(
lcm([8, 12] + map(lambda ed: 2 * ed, elementary_divisors_inv)))
zeta = CC(exp(2 * pi * I / zeta_order))
sqrt2 = CC(sqrt(2))
drt = CC(sqrt(L.det()))
Tmat = diagonal_matrix(CC, [
zeta**(zeta_order * disc_quadratic(*a))
for a in (singls + pairs if plus_basis else pairs)
])
if plus_basis:
Smat = zeta**(zeta_order / 8 * L_dimension) / drt \
* matrix( CC, [ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in singls]
+ [sqrt2 * zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in pairs]
for gamma in singls] \
+ [ [sqrt2 * zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in singls]
+ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) + zeta**(-zeta_order * disc_bilinear(*(gamma + map(operator.neg, delta)))) for delta in pairs]
for gamma in pairs] )
else:
Smat = zeta**(zeta_order / 8 * L_dimension) / drt \
* matrix( CC, [ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) - zeta**(-zeta_order * disc_bilinear(*(gamma + map(operator.neg,delta)))) for delta in pairs]
for gamma in pairs ] )
STmat = Smat * Tmat
## This function overestimates the number of eigenvalues, if it is not correct
def eigenvalue_multiplicity(mat, ev):
mat = matrix(CC, mat - ev * identity_matrix(subspace_dimension))
return len(
filter(lambda row: all(e.contains_zero() for e in row),
_qr(mat).rows()))
rti = CC(exp(2 * pi * I / 8))
S_ev_multiplicity = [
eigenvalue_multiplicity(Smat, rti**n) for n in range(8)
]
## Together with the fact that eigenvalue_multiplicity overestimates the multiplicities
## this asserts that the computed multiplicities are correct
assert sum(S_ev_multiplicity) == subspace_dimension
rho = CC(exp(2 * pi * I / 12))
ST_ev_multiplicity = [
eigenvalue_multiplicity(STmat, rho**n) for n in range(12)
]
## Together with the fact that eigenvalue_multiplicity overestimates the multiplicities
## this asserts that the computed multiplicities are correct
assert sum(ST_ev_multiplicity) == subspace_dimension
T_evs = [
ZZ((zeta_order * disc_quadratic(*a)) % zeta_order) / zeta_order
for a in (singls + pairs if plus_basis else pairs)
]
return subspace_dimension * (1 + QQ(k) / 12) \
- ZZ(sum( (ST_ev_multiplicity[n] * ((-2 * k - n) % 12)) for n in range(12) )) / 12 \
- ZZ(sum( (S_ev_multiplicity[n] * ((2 * k + n) % 8)) for n in range(8) )) / 8 \
- sum(T_evs)
def dimension__vector_valued(k, L, conjugate = False) :
r"""
Compute the dimension of the space of weight `k` vector valued modular forms
for the Weil representation (or its conjugate) attached to the lattice `L`.
See [Borcherds, Borcherds - Reflection groups of Lorentzian lattices] for a proof
of the formula that we use here.
INPUT:
- `k` -- A half-integer.
- ``L`` -- An quadratic form.
- ``conjugate`` -- A boolean; If ``True``, then compute the dimension for
the conjugated Weil representation.
OUTPUT:
An integer.
TESTS::
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 1, 1, 2])))
1
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 0, 0, 2])))
1
sage: dimension__vector_valued(3, QuadraticForm(-matrix(2, [2, 0, 0, 4])))
1
"""
if 2 * k not in ZZ :
raise ValueError( "Weight must be half-integral" )
if k <= 0 :
return 0
if k < 2 :
raise NotImplementedError( "Weight <2 is not implemented." )
if L.matrix().rank() != L.matrix().nrows() :
raise ValueError( "The lattice (={0}) must be non-degenerate.".format(L) )
L_dimension = L.matrix().nrows()
if L_dimension % 2 != ZZ(2 * k) % 2 :
return 0
plus_basis = ZZ(L_dimension + 2 * k) % 4 == 0
## The bilinear and the quadratic form attached to L
quadratic = lambda x: L(x) // 2
bilinear = lambda x,y: L(x + y) - L(x) - L(y)
## A dual basis for L
(elementary_divisors, dual_basis_pre, _) = L.matrix().smith_form()
elementary_divisors = elementary_divisors.diagonal()
dual_basis = map(operator.div, list(dual_basis_pre), elementary_divisors)
L_level = ZZ(lcm([ b.denominator() for b in dual_basis ]))
(elementary_divisors, _, discriminant_basis_pre) = (L_level * matrix(dual_basis)).change_ring(ZZ).smith_form()
elementary_divisors = filter( lambda d: d not in ZZ, (elementary_divisors / L_level).diagonal() )
elementary_divisors_inv = map(ZZ, [ed**-1 for ed in elementary_divisors])
discriminant_basis = matrix(map( operator.mul,
discriminant_basis_pre.inverse().rows()[:len(elementary_divisors)],
elementary_divisors )).transpose()
## This is a form over QQ, so that we cannot use an instance of QuadraticForm
discriminant_form = discriminant_basis.transpose() * L.matrix() * discriminant_basis
if conjugate :
discriminant_form = - discriminant_form
if prod(elementary_divisors_inv) > 100 :
disc_den = discriminant_form.denominator()
disc_bilinear_pre = \
cython_lambda( ', '.join( ['int a{0}'.format(i) for i in range(discriminant_form.nrows())]
+ ['int b{0}'.format(i) for i in range(discriminant_form.nrows())] ),
' + '.join('{0} * a{1} * b{2}'.format(disc_den * discriminant_form[i,j], i, j)
for i in range(discriminant_form.nrows())
for j in range(discriminant_form.nrows())) )
disc_bilinear = lambda *a: disc_bilinear_pre(*a) / disc_den
else :
disc_bilinear = lambda *xy: vector(ZZ, xy[:discriminant_form.nrows()]) * discriminant_form * vector(ZZ, xy[discriminant_form.nrows():])
disc_quadratic = lambda *a: disc_bilinear(*(2 * a)) / 2
## red gives a normal form for elements in the discriminant group
red = lambda x : map(operator.mod, x, elementary_divisors_inv)
def is_singl(x) :
y = red(map(operator.neg, x))
for (e, f) in zip(x, y) :
if e < f :
return -1
elif e > f :
return 1
return 0
## singls and pairs are elements of the discriminant group that are, respectively,
## fixed and not fixed by negation.
singls = list()
pairs = list()
for x in mrange(elementary_divisors_inv) :
si = is_singl(x)
if si == 0 :
singls.append(x)
elif si == 1 :
pairs.append(x)
if plus_basis :
subspace_dimension = len(singls + pairs)
else :
subspace_dimension = len(pairs)
## 200 bits are, by far, sufficient to distinguish 12-th roots of unity
## by increasing the precision by 4 for each additional dimension, we
## compensate, by far, the errors introduced by the QR decomposition,
## which are of the size of (absolute error) * dimension
CC = ComplexIntervalField(200 + subspace_dimension * 4)
zeta_order = ZZ(lcm([8, 12] + map(lambda ed: 2 * ed, elementary_divisors_inv)))
zeta = CC(exp(2 * pi * I / zeta_order))
sqrt2 = CC(sqrt(2))
drt = CC(sqrt(L.det()))
Tmat = diagonal_matrix(CC, [zeta**(zeta_order*disc_quadratic(*a)) for a in (singls + pairs if plus_basis else pairs)])
if plus_basis :
Smat = zeta**(zeta_order / 8 * L_dimension) / drt \
* matrix( CC, [ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in singls]
+ [sqrt2 * zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in pairs]
for gamma in singls] \
+ [ [sqrt2 * zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) for delta in singls]
+ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) + zeta**(-zeta_order * disc_bilinear(*(gamma + map(operator.neg, delta)))) for delta in pairs]
for gamma in pairs] )
else :
Smat = zeta**(zeta_order / 8 * L_dimension) / drt \
* matrix( CC, [ [zeta**(-zeta_order * disc_bilinear(*(gamma + delta))) - zeta**(-zeta_order * disc_bilinear(*(gamma + map(operator.neg,delta)))) for delta in pairs]
for gamma in pairs ] )
STmat = Smat * Tmat
## This function overestimates the number of eigenvalues, if it is not correct
def eigenvalue_multiplicity(mat, ev) :
mat = matrix(CC, mat - ev * identity_matrix(subspace_dimension))
return len(filter( lambda row: all( e.contains_zero() for e in row), _qr(mat).rows() ))
rti = CC(exp(2 * pi * I / 8))
S_ev_multiplicity = [eigenvalue_multiplicity(Smat, rti**n) for n in range(8)]
## Together with the fact that eigenvalue_multiplicity overestimates the multiplicities
## this asserts that the computed multiplicities are correct
assert sum(S_ev_multiplicity) == subspace_dimension
rho = CC(exp(2 * pi * I / 12))
ST_ev_multiplicity = [eigenvalue_multiplicity(STmat, rho**n) for n in range(12)]
## Together with the fact that eigenvalue_multiplicity overestimates the multiplicities
## this asserts that the computed multiplicities are correct
assert sum(ST_ev_multiplicity) == subspace_dimension
T_evs = [ ZZ((zeta_order * disc_quadratic(*a)) % zeta_order) / zeta_order
for a in (singls + pairs if plus_basis else pairs) ]
return subspace_dimension * (1 + QQ(k) / 12) \
- ZZ(sum( (ST_ev_multiplicity[n] * ((-2 * k - n) % 12)) for n in range(12) )) / 12 \
- ZZ(sum( (S_ev_multiplicity[n] * ((2 * k + n) % 8)) for n in range(8) )) / 8 \
- sum(T_evs)
def short_vector_list_up_to_length(self, len_bound, up_to_sign_flag=False):
"""
Return a list of lists of short vectors `v`, sorted by length, with
Q(`v`) < len_bound. The list in output `[i]` indexes all vectors of
length `i`. If the up_to_sign_flag is set to True, then only one of
the vectors of the pair `[v, -v]` is listed.
Note: This processes the PARI/GP output to always give elements of type `ZZ`.
OUTPUT:
a list of lists of vectors.
EXAMPLES::
sage: Q = DiagonalQuadraticForm(ZZ, [1,3,5,7])
sage: Q.short_vector_list_up_to_length(3)
[[(0, 0, 0, 0)], [(1, 0, 0, 0), (-1, 0, 0, 0)], []]
sage: Q.short_vector_list_up_to_length(4)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0), (-1, 0, 0, 0)],
[],
[(0, 1, 0, 0), (0, -1, 0, 0)]]
sage: Q.short_vector_list_up_to_length(5)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0), (-1, 0, 0, 0)],
[],
[(0, 1, 0, 0), (0, -1, 0, 0)],
[(1, 1, 0, 0),
(-1, -1, 0, 0),
(-1, 1, 0, 0),
(1, -1, 0, 0),
(2, 0, 0, 0),
(-2, 0, 0, 0)]]
sage: Q.short_vector_list_up_to_length(5, True)
[[(0, 0, 0, 0)],
[(1, 0, 0, 0)],
[],
[(0, 1, 0, 0)],
[(1, 1, 0, 0), (-1, 1, 0, 0), (2, 0, 0, 0)]]
sage: Q = QuadraticForm(matrix(6, [2, 1, 1, 1, -1, -1, 1, 2, 1, 1, -1, -1, 1, 1, 2, 0, -1, -1, 1, 1, 0, 2, 0, -1, -1, -1, -1, 0, 2, 1, -1, -1, -1, -1, 1, 2]))
sage: vs = Q.short_vector_list_up_to_length(40) #long time
The cases of ``len_bound < 2`` led to exception or infinite runtime before.
::
sage: Q.short_vector_list_up_to_length(0)
[]
sage: Q.short_vector_list_up_to_length(1)
[[(0, 0, 0, 0, 0, 0)]]
In the case of quadratic forms that are not positive definite an error is raised.
::
sage: QuadraticForm(matrix(2, [2, 0, 0, -2])).short_vector_list_up_to_length(3)
Traceback (most recent call last):
...
ValueError: Quadratic form must be positive definite in order to enumerate short vectors
Sometimes, Pari does not compute short vectors correctly. It returns too long vectors.
::
sage: mat = matrix(2, [72, 12, 12, 120]) #long time
sage: len_bound = 22953421 #long time
sage: gp_mat = gp.qfminim(str(gp(mat)), 2 * len_bound - 2)[3] #long time
sage: rows = [ map(ZZ, str(gp_mat[i,])[1:-1].split(',')) for i in range(1, gp_mat.matsize()[1] + 1) ] #long time
sage: vec_list = map(vector, zip(*rows)) #long time
sage: eval_v_cython = cython_lambda( ", ".join( "int a{0}".format(i) for i in range(2) ), " + ".join( "{coeff} * a{i} * a{j}".format(coeff = mat[i,j], i = i, j = j) for i in range(2) for j in range(2) ) ) #long time
sage: any( eval_v_cython(*v) == 2 * 22955664 for v in vec_list ) # 22955664 > 22953421 = len_bound #long time
True
"""
if not self.is_positive_definite() :
raise ValueError( "Quadratic form must be positive definite in order to enumerate short vectors" )
## Generate a PARI matrix string for the associated Hessian matrix
M_str = str(gp(self.matrix()))
if len_bound <= 0 :
return list()
elif len_bound == 1 :
return [ [(vector([ZZ(0) for _ in range(self.dim())]))] ]
## Generate the short vectors
gp_mat = gp.qfminim(M_str, 2*len_bound - 2)[3]
## We read all n-th entries at once so that not too many sage[...] variables are
## used. This is important when to many vectors are returned.
rows = [ map(ZZ, str(gp_mat[i,])[1:-1].split(','))
for i in range(1, gp_mat.matsize()[1] + 1) ]
vec_list = map(vector, zip(*rows))
if len(vec_list) > 500 :
eval_v_cython = cython_lambda( ", ".join( "int a{0}".format(i) for i in range(self.dim()) ),
" + ".join( "{coeff} * a{i} * a{j}".format(coeff = self[i,j], i = i, j = j)
for i in range(self.dim()) for j in range(i, self.dim()) ) )
eval_v = lambda v: eval_v_cython(*v)
else :
eval_v = self
## Sort the vectors into lists by their length
vec_sorted_list = [list() for i in range(len_bound)]
for v in vec_list:
v_evaluated = eval_v(v)
try :
vec_sorted_list[v_evaluated].append(v)
if not up_to_sign_flag :
vec_sorted_list[v_evaluated].append(-v)
except IndexError :
## We deal with a Pari but, that returns longer vectors that requested.
## E.g. : self.matrix() == matrix(2, [72, 12, 12, 120])
## len_bound = 22953421
## gives maximal length 22955664
pass
## Add the zero vector by hand
zero_vec = vector([ZZ(0) for _ in range(self.dim())])
vec_sorted_list[0].append(zero_vec)
## Return the sorted list
return vec_sorted_list
