Title | **Generating subfields** |

Author(s) | Mark van Hoeij, Jürgen Klüners, Andrew Novocin |

Type | Article in Journal |

Abstract | Given a field extension K / k of degree n we are interested in finding the subfields of K containing k. There can be more than polynomially many subfields. We introduce the notion of generating subfields, a set of up to n subfields whose intersections give the rest. We provide an efficient algorithm which uses linear algebra in k or lattice reduction along with factorization in any extension of K. Implementations show that previously difficult cases can now be handled. |

Keywords | Symbolic computation, Subfields, Lattice reduction |

ISSN | 0747-7171 |

URL |
http://www.sciencedirect.com/science/article/pii/S0747717112001277 |

Language | English |

Journal | Journal of Symbolic Computation |

Volume | 52 |

Number | 0 |

Pages | 17 - 34 |

Year | 2013 |

Note | International Symposium on Symbolic and Algebraic Computation |

Edition | 0 |

Translation |
No |

Refereed |
No |