PolynomialTraits_d::MakeSquareFree

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

PolynomialTraits_d::MakeSquareFree

Definition

This AdaptableBinaryFunction computes the square-free part of a polynomial of type PolynomialTraits_d::Polynomial_d up to a constant factor.

A polynomial p can be factored into square-free and pairwise coprime non-constant factors g_i with multiplicities m_i and a constant factor a, such that p = a ⋅ g₁^m₁ ⋅ ... ⋅ g_n^m_n, where all g_i are canonicalized.

Given this decomposition, the square free part is defined as the product g₁ ⋅ ... ⋅ g_n, which is computed by this functor.

Refines

AdaptableUnaryFunction
CopyConstructible
DefaultConstructible

Types

typedef PolynomialTraits_d::Polynomial_d
	result_type;
typedef PolynomialTraits_d::Polynomial_d
	argument_type;

Operations

result_type

fo ( argument_type p )

Returns the square-free part of p.