Detecting Algebraic and Linear Dependence with LLL
Recovering exact integer relations from numerical approximations using LLL, and the precision requirements that make the method reliable.
Every page in the KEVOS library tagged LLL. 10 pages.
Recovering exact integer relations from numerical approximations using LLL, and the precision requirements that make the method reliable.
The modular-lift-recombine pipeline, the exponential recombination problem, and the LLL-based algorithm that makes factorisation polynomial time.
Finding a small ideal in a given ideal class by lattice reduction, and why reduction is the enabling step for relation collection.
Computing a reduced basis of the integer kernel and image of a matrix, and why this is not the same as clearing denominators from a rational kernel.
Extending LLL to generating sets that are not independent, and using the resulting zero vectors to extract relations.
Using lattice reduction to control entry growth during Hermite normal form computation, and when this beats the modular approach.
The LLL algorithm: size reduction interleaved with swaps under the Lovasz condition, and the guarantees it provides in polynomial time.
The LLL algorithm: size reduction interleaved with swaps under the Lovasz condition, and the guarantees it provides in polynomial time.
Finding a small defining polynomial for a number field using lattice reduction on the maximal order, and why this pays for itself.
Finding the subfields of a number field, by lattice methods and by linear algebra over the complex numbers.