Generating subfields
M. van Hoeij, J. Klüners, A. Novocin, Journal of Symbolic Computation 52 (2011) 17–34.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
van Hoeij, Mark;
Klüners, JürgenLibreCat;
Novocin, Andrew
Department
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.
Publishing Year
Journal Title
Journal of Symbolic Computation
Volume
52
Page
17-34
ISSN
LibreCat-ID
Cite this
van Hoeij M, Klüners J, Novocin A. Generating subfields. Journal of Symbolic Computation. 2011;52:17-34. doi:10.1016/j.jsc.2012.05.010
van Hoeij, M., Klüners, J., & Novocin, A. (2011). Generating subfields. Journal of Symbolic Computation, 52, 17–34. https://doi.org/10.1016/j.jsc.2012.05.010
@article{van Hoeij_Klüners_Novocin_2011, title={Generating subfields}, volume={52}, DOI={10.1016/j.jsc.2012.05.010}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={van Hoeij, Mark and Klüners, Jürgen and Novocin, Andrew}, year={2011}, pages={17–34} }
Hoeij, Mark van, Jürgen Klüners, and Andrew Novocin. “Generating Subfields.” Journal of Symbolic Computation 52 (2011): 17–34. https://doi.org/10.1016/j.jsc.2012.05.010.
M. van Hoeij, J. Klüners, and A. Novocin, “Generating subfields,” Journal of Symbolic Computation, vol. 52, pp. 17–34, 2011, doi: 10.1016/j.jsc.2012.05.010.
van Hoeij, Mark, et al. “Generating Subfields.” Journal of Symbolic Computation, vol. 52, Elsevier BV, 2011, pp. 17–34, doi:10.1016/j.jsc.2012.05.010.
Google Scholar