Square-free polynomials are polynomials that do not have any square of a non-constant polynomial as a divisor. They can be identified by their lack of multiple roots in an algebraically closed field, and can be decomposed into powers of square-free polynomials. Algorithms exist to compute the square-free decomposition of both univariate and multivariate polynomials.
Carnegie Mellon University
Spring 2012
This course explores the relationship between algebra and computation, focusing on algorithms used for symbolic computation and modern algebra concepts. Subjects covered include proving combinatorial identities, Gröbner bases, symbolic integration, and experimental mathematics. Prerequisites suggest this is a mid-level course.
No concepts data
+ 32 more concepts