Factorization of Multivariate Polynomials over Algebraic Number Fields with Multiple Extensions

Polynomial factorization is a core problem in Computer Algebra, with significant applications across fields such as coding theory, cryptography, number theory, solving systems of polynomials, and algebraic geometry. This project aims to develop an efficient algorithm for factoring multivariate polynomials over algebraic number fields with multiple extensions, addressing a key computational challenge in modern algebraic systems. The partner organization, Maplesoft, seeks assistance in improving polynomial factorization over algebraic number fields and function fields. Currently, Maple often struggles with long computation times or fails to complete the factorization of polynomials arising in practice. This project will contribute to overcoming these limitations by developing a more efficient factorization algorithm.

Faculty Supervisor:

Michael Monagan

Student:

Partner:

Maplesoft

Discipline:

Mathematics

Sector:

Information and cultural industries; Professional, scientific and technical services

University:

Simon Fraser University

Program: