Integer lattices enjoy increasing interest among mathematicians and cryptographers. However, there are still many elementary open questions, like finding specific vectors or particular bases of a given lattice. Our study consists in exhibiting which integer vectors may be chosen as basis vectors of a chosen lattice. The compelling part of our development is that this condition is obtained through an unusual application of Dirichlet's Theorem on primes in arithmetic progressions and that it has a surprising consequence for vectors achieving the successive minima
Lattices are an easy and clean class of periodic arrangements that are not only discrete but associa...
Recently Aardal et al. (2000) have successfully solved some small, difficult, equality-constrained i...
We show that with respect to a certain class of norms the so called shortest lattice vector problem ...
Integer lattices enjoy increasing interest among mathematicians and cryptographers. However, there a...
Lattices over number fields arise from a variety of sources in algorithmic algebra and more recently...
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an...
We review and describe several results regarding integer programming problems in fixed dimension. Fi...
We prove that all Euclidean lattices of dimension n≤9 which are generated by their minimal vectors, ...
Recently Aardal et al. (2000) have successfully solved some small, difficult, equality-constrained i...
Abstract. It is shown that in all dimensions n ^ l l there exists a lattice which is generated by it...
We present a generalization of the Euclidean algorithm, and ap-ply it to give a solution to the foll...
Let Ai(L), Ai(L*) denote the successive minima of a lattice L and its reciprocal lattice L*, and let...
We describe how a shortest vector of a 2-dimensional integral lattice corresponds to a best approxim...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
We prove that for any fixed d the generating function of the projection of the set of integer point...
Lattices are an easy and clean class of periodic arrangements that are not only discrete but associa...
Recently Aardal et al. (2000) have successfully solved some small, difficult, equality-constrained i...
We show that with respect to a certain class of norms the so called shortest lattice vector problem ...
Integer lattices enjoy increasing interest among mathematicians and cryptographers. However, there a...
Lattices over number fields arise from a variety of sources in algorithmic algebra and more recently...
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an...
We review and describe several results regarding integer programming problems in fixed dimension. Fi...
We prove that all Euclidean lattices of dimension n≤9 which are generated by their minimal vectors, ...
Recently Aardal et al. (2000) have successfully solved some small, difficult, equality-constrained i...
Abstract. It is shown that in all dimensions n ^ l l there exists a lattice which is generated by it...
We present a generalization of the Euclidean algorithm, and ap-ply it to give a solution to the foll...
Let Ai(L), Ai(L*) denote the successive minima of a lattice L and its reciprocal lattice L*, and let...
We describe how a shortest vector of a 2-dimensional integral lattice corresponds to a best approxim...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
We prove that for any fixed d the generating function of the projection of the set of integer point...
Lattices are an easy and clean class of periodic arrangements that are not only discrete but associa...
Recently Aardal et al. (2000) have successfully solved some small, difficult, equality-constrained i...
We show that with respect to a certain class of norms the so called shortest lattice vector problem ...