Lattices in Algorithmic Mathematics
Time and place
1 PM on Thursday, October 25th, 2007; ***Special Room*** NAC 1/511E (Artino Lab)
Jaime Gutierrez (University of Cantabria, Spain)
Abstract
Our world is not linear. Many phenomena, however, are often "linearized" because only then a reasonably well-working mathematical machinery can describe the phenomena and produce meaningful forecasts.
Lattices are geometric objects that have been used to solve many problems in mathematics and computer science. Lattice reduction strategies or the so called LLL-techniques seem inherently linear. The general idea of this technique is to translate our non linear problem to finding a short vector in a lattice built from the nonlinear equation. Then, the so-called Shortest Vector Problem and Closest Vector Problem in lattices play a major role. In recent years, these techniques have been used repeatedly in algorithmic coding theory and cryptography.
In this talk I will investigate lattice reduction technique on some algebraic problems, namely - to compute intermediate subfields, - to study Cayley graphs: Groebner basis and LLL-reduced basis
